{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:45:01Z","timestamp":1742913901676,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662480533"},{"type":"electronic","value":"9783662480540"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48054-0_33","type":"book-chapter","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T11:57:29Z","timestamp":1439207849000},"page":"395-406","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Price of Connectivity for Cycle\u00a0Transversals"],"prefix":"10.1007","author":[{"given":"Tatiana R.","family":"Hartinger","sequence":"first","affiliation":[]},{"given":"Matthew","family":"Johnson","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Milani\u010d","sequence":"additional","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Belmonte, R., van \u2019t Hof, P., Kami\u0144ski, M., Paulusma, D.: The price of connectivity for feedback vertex set. In: Proceedings of the EuroComb 2013 CRMS 16, pp. 123\u2013128 (2013)","DOI":"10.1007\/978-88-7642-475-5_20"},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/978-3-662-44465-8_6","volume-title":"Mathematical Foundations of Computer Science 2014","author":"R Belmonte","year":"2014","unstructured":"Belmonte, R., van \u2019t Hof, P., Kami\u0144ski, M., Paulusma, D.: Forbidden induced subgraphs and the price of connectivity for feedback vertex set. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part II. LNCS, vol. 8635, pp. 57\u201368. Springer, Heidelberg (2014)"},{"key":"33_CR3","first-page":"207","volume":"16","author":"E Camby","year":"2014","unstructured":"Camby, E., Cardinal, J., Fiorini, S., Schaudt, O.: The Price of Connectivity for Vertex Cover. Discrete Math. Theor. Comput. Sci. 16, 207\u2013224 (2014)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.dam.2014.05.029","volume":"17","author":"E Camby","year":"2014","unstructured":"Camby, E., Schaudt, O.: The price of connectivity for dominating set: Upper bounds and complexity. Discrete Appl. Math. 17, 53\u201359 (2014)","journal-title":"Discrete Appl. Math."},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"2581","DOI":"10.1016\/j.tcs.2010.03.021","volume":"411","author":"J Cardinal","year":"2010","unstructured":"Cardinal, J., Levy, E.: Connected vertex covers in dense graphs. Theoret. Comput. Sci. 411, 2581\u20132590 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"33_CR6","first-page":"71","volume":"13","author":"P Duchet","year":"1982","unstructured":"Duchet, P., Meyniel, H.: On Hadwiger\u2019s number and the stability number. Ann. Discret. Math. 13, 71\u201374 (1982)","journal-title":"Ann. Discret. Math."},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-11409-0_13","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A Grigoriev","year":"2010","unstructured":"Grigoriev, A., Sitters, R.: Connected Feedback Vertex Set in Planar Graphs. In: Paul, C., Habib, M. (eds.) WG 2009. LNCS, vol. 5911, pp. 143\u2013153. Springer, Heidelberg (2010)"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.ipl.2010.10.008","volume":"111","author":"P Schweitzer","year":"2010","unstructured":"Schweitzer, P., Schweitzer, P.: Connecting face hitting sets in planar graphs. Inf. Process. Lett. 111, 11\u201315 (2010)","journal-title":"Inf. Process. Lett."},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"159","DOI":"10.7151\/dmgt.1192","volume":"23","author":"IE Zverovich","year":"2003","unstructured":"Zverovich, I.E.: Perfect connected-dominant graphs. Discussiones Math. Graph Theor. 23, 159\u2013162 (2003)","journal-title":"Discussiones Math. Graph Theor."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48054-0_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T13:40:01Z","timestamp":1674567601000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48054-0_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662480533","9783662480540"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48054-0_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"11 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}