For a family of graphs F, an F-transversal of a graph G is a subset S ⊆ V (G) that intersects every subset of V (G) that induces a subgraph isomorphic to a graph in F. Let tF(G) be the minimum size of an F-transversal of G, and ctF(G) be the minimum size of an Ftransversal of G that induces a connected graph. For a class of connected graphs G, the price of connectivity for F-transversals is the supremum of the ratios ctF(G)/tF(G) over all G ∈ G. We perform an in-depth study into the price of connectivity for various well-known graph families F that contain an infinite number of cycles and that, in addition, may contain one or more anticycles or short paths. For each of these families we study the price of connectivity for classes of graphs characterized by one forbidden induced subgraph H. We determine exactly those classes of H free graphs for which this graph parameter is bounded by a multiplicative constant, bounded by an additive constant, or equal to 1. In particular, our tetrachotomies extend known results of Belmonte et al. (EuroComb 2012, MFCS 2013) for the case when F is the family of all cycles.
CITATION STYLE
Hartinger, T. R., Johnson, M., Milanič, M., & Paulusma, D. (2015). The price of connectivity for cycle transversals. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9235, pp. 395–406). Springer Verlag. https://doi.org/10.1007/978-3-662-48054-0_33
Mendeley helps you to discover research relevant for your work.