| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652465 | Electronic Notes in Discrete Mathematics | 2009 | 7 Pages |
Abstract
In this work we consider the problem of finding a minimum Ck-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 Ck-transversal is polynomial-time solvable if k⩽p, and NP-hard otherwise.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
