{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T19:24:24Z","timestamp":1791228264408,"version":"4.1.0"},"reference-count":20,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:p>We prove new complexity results for Feedback Vertex Set and Even Cycle Transversal on $H$-free graphs, that is, graphs that do not contain some fixed graph $H$ as an induced subgraph. In particular, we prove that for every $s\\geq 1$, both problems are polynomial-time solvable for $sP_3$-free graphs and $(sP_1+P_5)$-free graphs; here, the graph $sP_3$ denotes the disjoint union of $s$ paths on three vertices and the graph $sP_1+P_5$ denotes the disjoint union of $s$ isolated vertices and a path on five vertices. Our new results for Feedback Vertex Set extend all known polynomial-time results for Feedback Vertex Set on $H$-free graphs, namely for $sP_2$-free graphs [Chiarelli et al., Theoret. Comput. Sci., 705 (2018), pp. 75--83], $(sP_1+P_3)$-free graphs [Dabrowski et al., Algorithmica, 82 (2020), pp. 2841--2866] and $P_5$-free graphs [Abrishami et al., Induced subgraphs of bounded treewidth and the container method, in Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, Philadelphia, 2021, pp. 1948--1964]. Together, the new results also show that both problems exhibit the same behavior on $H$-free graphs (subject to some open cases). This is in part due to a new general algorithm we design for finding in a ($sP_3)$-free or $(sP_1+P_5)$-free graph $G$ a largest induced subgraph whose blocks belong to some finite class ${\\cal C}$ of graphs. We also compare our results with the state-of-the-art results for the Odd Cycle Transversal problem, which is known to behave differently on $H$-free graphs.<\/jats:p>","DOI":"10.1137\/22m1468864","type":"journal-article","created":{"date-parts":[[2022,10,4]],"date-time":"2022-10-04T10:41:14Z","timestamp":1664880074000},"page":"2453-2472","source":"Crossref","is-referenced-by-count":9,"title":["Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs"],"prefix":"10.1137","volume":"36","author":[{"given":"Giacomo","family":"Paesani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7696-3848","authenticated-orcid":true,"given":"Pawe\u0142","family":"Rz\u0105\u017cwski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2022,10,4]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.116"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-022-10076-x"},{"key":"atypb3","volume-title":"Proceedings of the 15th International Symposium on Parameterized and Exact Computation, LIPIcs. Leibniz Int. Proc. Inform. 180","author":"Bergougnoux B.","year":"2020"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53536-3_20"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.09.031"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0028791"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2017.11.029"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.09.033"},{"key":"atypb9","volume-title":"Encyclopedia Math. Appl. 138","author":"Courcelle B.","year":"2012"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00706-6"},{"key":"atypb11","first-page":"330","volume-title":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, ACM","author":"Gartland P."},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.77"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-019-00601-9"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0317-1"},{"key":"atypb15","first-page":"570","volume-title":"Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, ACM","author":"Lokshantov D.","year":"2014"},{"key":"atypb16","series-title":"Lecture Notes in Comput. Sci. 7551","first-page":"172","volume-title":"Graph-theoretic Concepts in Computer Science","author":"Misra P."},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2017.01.006"},{"key":"atypb18","volume-title":"Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, LIPIcs. Leibniz Int. Proc. Inform. 202","author":"Paesani G.","year":"2021"},{"key":"atypb19","first-page":"307","volume":"15","author":"Poljak S.","year":"1974","journal-title":"Comment. Math. Univ. Carolinae"},{"key":"atypb20","first-page":"5","author":"Vornberger O.","year":"1979","journal-title":"Reihe Theoretische Informatik"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/22M1468864","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:37:34Z","timestamp":1787319454000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/22M1468864"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,4]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["10.1137\/22M1468864"],"URL":"https:\/\/doi.org\/10.1137\/22m1468864","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,4]]}}}