On complexity of total vertex cover on subcubic graphs

Sheung Hung Poon, Wei Lin Wang

Research output: Chapter in Book/Conference proceedingConference contributionpeer-review

Abstract

A total vertex cover is a vertex cover whose induced subgraph consists of a set of connected components, each of which contains at least two vertices. A t-total vertex cover is a total vertex cover where each component of its induced subgraph contains at least t vertices. The total vertex cover (TVC) problem and the t-total vertex cover (t-TVC) problem ask for the corresponding cover set with minimum cardinality, respectively. In this paper, we first show that the t-TVC problem is NP-complete for connected subcubic grid graphs of arbitrarily large girth. Next, we show that the t-TVC problem is NP-complete for 3-connected cubic planar graphs. Moreover, we show that the t-TVC problem is APX-complete for connected subcubic graphs of arbitrarily large girth.

Original languageEnglish
Title of host publicationTheory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Proceedings
EditorsGerhard Jager, Silvia Steila, T.V. Gopal
PublisherSpringer Verlag
Pages515-528
Number of pages14
ISBN (Print)9783319559100
DOIs
Publication statusPublished - 2017
Externally publishedYes
Event14th Annual Conference on Theory and Applications of Models of Computation, TAMC 2017 - Bern, Switzerland
Duration: 20 Apr 201722 Apr 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10185 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th Annual Conference on Theory and Applications of Models of Computation, TAMC 2017
Country/TerritorySwitzerland
CityBern
Period20/04/1722/04/17

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'On complexity of total vertex cover on subcubic graphs'. Together they form a unique fingerprint.

Cite this