Abstract
For a family of graphs \({\mathcal F}\), an \(\mathcal {F}\)-transversal of a graph G is a subset \(S \subseteq V(G)\) that intersects every subset of V(G) that induces a subgraph isomorphic to a graph in \(\mathcal {F}\). Let \(t_\mathcal {F}(G)\) be the minimum size of an \(\mathcal {F}\)-transversal of G, and \( ct _\mathcal {F}(G)\) be the minimum size of an \(\mathcal {F}\)-transversal of G that induces a connected graph. For a class of connected graphs \(\mathcal{G}\), the price of connectivity for \(\mathcal {F}\)-transversals is the supremum of the ratios \( ct _\mathcal {F}(G)/t_\mathcal {F}(G)\) over all \(G\in \mathcal{G}\). We perform an in-depth study into the price of connectivity for various well-known graph families \(\mathcal{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 \(\mathcal{F}\) is the family of all cycles.
This work was supported by a London Mathematical Society Scheme 4 Grant and by EPSRC Grant EP/K025090/1, and, in part, by the Slovenian Research Agency (I0-0035, research program P1-0285, research projects N1-0032, J1-5433, J1-6720, and J1-6743, and a Young Researchers Grant).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Belmonte, R., van ’t Hof, P., Kamiński, M., Paulusma, D.: The price of connectivity for feedback vertex set. In: Proceedings of the EuroComb 2013 CRMS 16, pp. 123–128 (2013)
Belmonte, R., van ’t Hof, P., Kamiński, M., Paulusma, D.: Forbidden induced subgraphs and the price of connectivity for feedback vertex set. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds.) MFCS 2014, Part II. LNCS, vol. 8635, pp. 57–68. Springer, Heidelberg (2014)
Camby, E., Cardinal, J., Fiorini, S., Schaudt, O.: The Price of Connectivity for Vertex Cover. Discrete Math. Theor. Comput. Sci. 16, 207–224 (2014)
Camby, E., Schaudt, O.: The price of connectivity for dominating set: Upper bounds and complexity. Discrete Appl. Math. 17, 53–59 (2014)
Cardinal, J., Levy, E.: Connected vertex covers in dense graphs. Theoret. Comput. Sci. 411, 2581–2590 (2010)
Duchet, P., Meyniel, H.: On Hadwiger’s number and the stability number. Ann. Discret. Math. 13, 71–74 (1982)
Grigoriev, A., Sitters, R.: Connected Feedback Vertex Set in Planar Graphs. In: Paul, C., Habib, M. (eds.) WG 2009. LNCS, vol. 5911, pp. 143–153. Springer, Heidelberg (2010)
Schweitzer, P., Schweitzer, P.: Connecting face hitting sets in planar graphs. Inf. Process. Lett. 111, 11–15 (2010)
Zverovich, I.E.: Perfect connected-dominant graphs. Discussiones Math. Graph Theor. 23, 159–162 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hartinger, T.R., Johnson, M., Milanič, M., Paulusma, D. (2015). The Price of Connectivity for Cycle Transversals. In: Italiano, G., Pighizzini, G., Sannella, D. (eds) Mathematical Foundations of Computer Science 2015. MFCS 2015. Lecture Notes in Computer Science(), vol 9235. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48054-0_33
Download citation
DOI: https://doi.org/10.1007/978-3-662-48054-0_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48053-3
Online ISBN: 978-3-662-48054-0
eBook Packages: Computer ScienceComputer Science (R0)