{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T00:46:28Z","timestamp":1768783588400,"version":"3.49.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T00:00:00Z","timestamp":1560988800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T00:00:00Z","timestamp":1560988800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000275","name":"Leverhulme Trust","doi-asserted-by":"publisher","award":["RPG-2016-258"],"award-info":[{"award-number":["RPG-2016-258"]}],"id":[{"id":"10.13039\/501100000275","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s00453-019-00601-9","type":"journal-article","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T07:24:17Z","timestamp":1561015457000},"page":"20-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Connected Vertex Cover for $$(sP_1+P_5)$$-Free Graphs"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7295-2663","authenticated-orcid":false,"given":"Matthew","family":"Johnson","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2383-1339","authenticated-orcid":false,"given":"Giacomo","family":"Paesani","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5945-9287","authenticated-orcid":false,"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,20]]},"reference":[{"key":"601_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(02)00290-1","volume":"135","author":"VE Alekseev","year":"2004","unstructured":"Alekseev, V.E.: Polynomial algorithm for finding the largest independent sets in graphs without forks. Discrete Appl. Math. 135, 3\u201316 (2004)","journal-title":"Discrete Appl. Math."},{"key":"601_CR2","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF02352694","volume":"21","author":"G Bacs\u00f3","year":"1990","unstructured":"Bacs\u00f3, G., Tuza, Z.S.: Dominating cliques in $P_5$-free graphs. Period. Math. Hung. 21, 303\u2013308 (1990)","journal-title":"Period. Math. Hung."},{"key":"601_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(96)00054-3","volume":"58","author":"V Balachandhran","year":"1996","unstructured":"Balachandhran, V., Nagavamsi, P., Pandu Rangan, C.: Clique transversal and clique independence on comparability graphs. Inf. Process. Lett. 58, 181\u2013184 (1996)","journal-title":"Inf. Process. Lett."},{"key":"601_CR4","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1002\/net.3230190206","volume":"19","author":"E Balas","year":"1989","unstructured":"Balas, E., Yu, C.S.: On graphs with polynomially solvable maximum-weight clique problem. Networks 19, 247\u2013253 (1989)","journal-title":"Networks"},{"key":"601_CR5","doi-asserted-by":"publisher","first-page":"1342","DOI":"10.1007\/s00453-018-0474-x","volume":"81","author":"M Bonamy","year":"2019","unstructured":"Bonamy, M., Dabrowski, K.K., Feghali, C., Johnson, M., Paulusma, D.: Independent feedback vertex set for $P_5$-free graphs. Algorithmica 81, 1342\u20131369 (2019)","journal-title":"Algorithmica"},{"key":"601_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.dam.2017.11.029","volume":"237","author":"A Brandst\u00e4dt","year":"2018","unstructured":"Brandst\u00e4dt, A., Mosca, R.: Maximum weight independent set for $\\ell $claw-free graphs in polynomial time. Discrete Appl. Math. 237, 57\u201364 (2018)","journal-title":"Discrete Appl. Math."},{"key":"601_CR7","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":"601_CR8","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s00453-015-9989-6","volume":"75","author":"E Camby","year":"2016","unstructured":"Camby, E., Schaudt, O.: A new characterization of $P_k$-free graphs. Algorithmica 75, 205\u2013217 (2016)","journal-title":"Algorithmica"},{"key":"601_CR9","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. Theor. Comput. Sci. 411, 2581\u20132590 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"601_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2017.09.033","volume":"705","author":"N Chiarelli","year":"2018","unstructured":"Chiarelli, N., Hartinger, T.R., Johnson, M., Milanic, M., Paulusma, D.: Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity. Theor. Comput. Sci. 705, 75\u201383 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"601_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00453-013-9777-0","volume":"71","author":"J-F Couturier","year":"2015","unstructured":"Couturier, J.-F., Golovach, P.A., Kratsch, D., Paulusma, D.: List coloring in the absence of a linear forest. Algorithmica 71, 21\u201335 (2015)","journal-title":"Algorithmica"},{"key":"601_CR12","first-page":"36","volume":"8","author":"B Escoffier","year":"2010","unstructured":"Escoffier, B., Gourv\u00e8s, L., Monnot, J.: Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. Theor. Comput. Sci. 8, 36\u201349 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"601_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.jda.2008.09.007","volume":"7","author":"H Fernau","year":"2009","unstructured":"Fernau, H., Manlove, D.: Vertex and edge covers with clustering properties: complexity and algorithms. J. Discrete Algorithms 7, 149\u2013167 (2009)","journal-title":"J. Discrete Algorithms"},{"key":"601_CR14","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"MR Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math. 32, 826\u2013834 (1977)","journal-title":"SIAM J. Appl. Math."},{"key":"601_CR15","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F Gavril","year":"1974","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb. Theory Ser. B 16, 47\u201356 (1974)","journal-title":"J. Comb. Theory Ser. B"},{"key":"601_CR16","doi-asserted-by":"crossref","unstructured":"Golovach, P.A., Heggernes, P.: Choosability of $P_5$-free graphs. In: Proceedings of the MFCS 2009, Lecture Notes in Computer Science, vol. 5734, pp. 382\u2013391 (2009)","DOI":"10.1007\/978-3-642-03816-7_33"},{"key":"601_CR17","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1002\/jgt.22028","volume":"84","author":"PA Golovach","year":"2017","unstructured":"Golovach, P.A., Johnson, M., Paulusma, D., Song, J.: A survey on the computational complexity of colouring graphs with forbidden subgraphs. J Graph Theory 84, 331\u2013363 (2017)","journal-title":"J Graph Theory"},{"key":"601_CR18","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1137\/1.9781611975482.77","volume-title":"Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Andrzej Grzesik","year":"2019","unstructured":"Grzesik, A., Klimo\u0161ov\u00e1, T., Pilipczuk, M., Pilipczuk, M.: Polynomial-time algorithm for maximum weight independent set on $P_6$-free graphs. In: Proceedings of the SODA, pp. 1257\u20131271 (2019)"},{"key":"601_CR19","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0166-218X(99)00159-6","volume":"100","author":"V Guruswami","year":"2000","unstructured":"Guruswami, V., Pandu Rangan, C.: Algorithmic aspects of clique-transversal and clique-independent sets. Discrete Appl. Math. 100, 183\u2013202 (2000)","journal-title":"Discrete Appl. Math."},{"key":"601_CR20","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.ejc.2016.06.003","volume":"58","author":"TR Hartinger","year":"2016","unstructured":"Hartinger, T.R., Johnson, M., Milanic, M., Paulusma, D.: The price of connectivity for transversals. Eur. J. Comb. 58, 203\u2013224 (2016)","journal-title":"Eur. J. Comb."},{"key":"601_CR21","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/s00453-008-9197-8","volume":"57","author":"CT Ho\u00e0ng","year":"2010","unstructured":"Ho\u00e0ng, C.T., Kami\u0144ski, M., Lozin, V.V., Sawada, J., Shu, X.: Deciding $k$-colorability of $P_5$-free graphs in polynomial time. Algorithmica 57, 74\u201381 (2010)","journal-title":"Algorithmica"},{"key":"601_CR22","doi-asserted-by":"crossref","unstructured":"Johnson, M., Paesani, G., Paulusma, D.: Connected vertex cover for $(sP_1+P_5)$-free graphs. In: Proceedings of the WG 2018, Lecture Notes in Computer Science, vol. 11159, pp. 279\u2013291 (2018)","DOI":"10.1007\/978-3-030-00256-5_23"},{"key":"601_CR23","unstructured":"Kern, W., Paulusma, D.: Contracting to a longest path in H-free graphs. Manuscript. arXiv:1810.01542"},{"key":"601_CR24","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-45477-2_23","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"Daniel Kr\u00e1l\u2019","year":"2001","unstructured":"Kr\u00e1l\u2019, D., Kratochv\u00edl, J., Tuza, Zs, Woeginger, G.J.: Complexity of coloring graphs without forbidden induced subgraphs. In: Proceedings of the WG 2001, Lecture Notes in Computer Science, vol. 2204, pp. 254\u2013262 (2001)"},{"key":"601_CR25","first-page":"107","volume":"301","author":"Y Li","year":"2017","unstructured":"Li, Y., Yang, Z., Wang, W.: Complexity and algorithms for the connected vertex cover problem in 4-regular graphs. Appl. Math. Comput. 301, 107\u2013114 (2017)","journal-title":"Appl. Math. Comput."},{"key":"601_CR26","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Vatshelle, M., Villanger, Y.: Independent set in $P_5$-free graphs in polynomial time. In: Proceedings of the SODA, pp. 570\u2013581 (2014)","DOI":"10.1137\/1.9781611973402.43"},{"key":"601_CR27","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","volume":"28","author":"GJ Minty","year":"1980","unstructured":"Minty, G.J.: On maximal independent sets of vertices in claw-free graphs. J. Comb. Theory Ser. B 28, 284\u2013304 (1980)","journal-title":"J. Comb. Theory Ser. B"},{"key":"601_CR28","doi-asserted-by":"publisher","first-page":"387","DOI":"10.7151\/dmgt.1598","volume":"32","author":"R Mosca","year":"2012","unstructured":"Mosca, R.: Stable sets for $(P_6, K_{2, 3})$-free graphs. Discus. Math. Graph Theory 32, 387\u2013401 (2012)","journal-title":"Discus. Math. Graph Theory"},{"key":"601_CR29","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.tcs.2017.06.012","volume":"692","author":"A Munaro","year":"2017","unstructured":"Munaro, A.: Boundary classes for graph problems involving non-local properties. Theor. Comput. Sci. 692, 46\u201371 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"601_CR30","first-page":"307","volume":"15","author":"S Poljak","year":"1974","unstructured":"Poljak, S.: A note on stable sets and colorings of graphs. Comment. Math. Univ. Carol. 15, 307\u2013309 (1974)","journal-title":"Comment. Math. Univ. Carol."},{"key":"601_CR31","first-page":"51","volume":"2","author":"PK Priyadarsini","year":"2008","unstructured":"Priyadarsini, P.K., Hemalatha, T.: Connected vertex cover in 2-connected planar graph with maximum degree 4 is NP-complete. Int. J. Math. Phys. Eng. Sci. 2, 51\u201354 (2008)","journal-title":"Int. J. Math. Phys. Eng. Sci."},{"key":"601_CR32","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","volume":"29","author":"N Sbihi","year":"1980","unstructured":"Sbihi, N.: Algorithme de recherche d\u2019un stable de cardinalit\u00e9 maximum dans un graphe sans \u00e9toile. Discrete Math. 29, 53\u201376 (1980)","journal-title":"Discrete Math."},{"key":"601_CR33","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6, 505\u2013517 (1977)","journal-title":"SIAM J. Comput."},{"key":"601_CR34","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/0012-365X(88)90226-9","volume":"72","author":"S Ueno","year":"1988","unstructured":"Ueno, S., Kajitani, Y., Gotoh, S.: On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three. Discrete Math. 72, 355\u2013360 (1988)","journal-title":"Discrete Math."},{"key":"601_CR35","doi-asserted-by":"publisher","first-page":"4834","DOI":"10.1016\/j.tcs.2009.06.028","volume":"410","author":"P van \u2019t Hof","year":"2009","unstructured":"van \u2019t Hof, P., Paulusma, D., Woeginger, G.J.: Partitioning graphs in connected parts. Theor. Comput. Sci. 410, 4834\u20134843 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"601_CR36","doi-asserted-by":"crossref","unstructured":"Wanatabe, T., Kajita, S., Onaga, K.: Vertex covers and connected vertex covers in 3-connected graphs. In: Proceedings of the IEEE International Symposium on Circuits and Systems, pp. 1017\u20131020 (1991)","DOI":"10.1109\/ISCAS.1991.176537"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00601-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-019-00601-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00601-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,20]],"date-time":"2024-07-20T00:07:41Z","timestamp":1721434061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-019-00601-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,20]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["601"],"URL":"https:\/\/doi.org\/10.1007\/s00453-019-00601-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,20]]},"assertion":[{"value":"5 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}