@inproceedings { ,
title = {On cycle transversals and their connected variants in the absence of a small linear forest},
abstract = {A graph is H-free if it contains no induced subgraph isomorphic to H. We prove new complexity results for the two classical cycle transversal problems Feedback Vertex Set and Odd Cycle Transversal by showing that they can be solved in polynomial time for (sP1+P3) -free graphs for every integer s≥1 . We show the same result for the variants Connected Feedback Vertex Set and Connected Odd Cycle Transversal. For the latter two problems we also prove that they are polynomial-time solvable for cographs; this was known already for Feedback Vertex Set and Odd Cycle Transversal.},
conference = {FCT 2019},
doi = {10.1007/978-3-030-25027-0\_18},
isbn = {9783030250263},
note = {EPrint Processing Status: Full text deposited in DRO},
pages = {258-273},
publicationstatus = {Published},
publisher = {Springer Verlag},
url = {https://durham-repository.worktribe.com/output/1142630},
keyword = {Algorithms and Complexity in Durham (ACiD)},
year = {2019},
author = {Feghali, C. and Johnson, M. and Paesani, G. and Paulusma, D.}
editor = {Gąsieniec, Leszek Antoni and Jansson, Jesper and Levcopoulos, Christos}
}