Title of article
Cycle transversals in bounded degree graphs
Author/Authors
Groshaus، نويسنده , , M. and Hell، نويسنده , , P. and Klein، نويسنده , , S. and Nogueira، نويسنده , , L.T. and Protti، نويسنده , , F.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
7
From page
189
To page
195
Abstract
In this work we consider the problem of finding a minimum C k -transversal (a subset of vertices hitting all the induced chordless cycles with k vertices) in a graph with bounded maximum degree. In particular, we seek for dichotomy results as follows: for a fixed value of k, finding a minimum C k -transversal is polynomial-time solvable if k ⩽ p , and NP-hard otherwise.
Keywords
Transversal , H -free graph , H -subgraph , H -transversal
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2009
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455294
Link To Document