@article { ,
title = {Computing subset transversals in H-free graphs},
abstract = {we study the computational complexity of two well-known graph transversal problems, namely Subset Feedback Vertex Set and Subset Odd Cycle Transversal, by restricting the input to H-free graphs, that is, to graphs that do not contain some fixed graph H as an induced subgraph. By combining known and new results, we determine the computational complexity of both problems on H-free graphs for every graph H except when H = sP1 + P4 for some s ≥ 1. As part of our approach, we introduce the Subset Vertex Cover problem and prove that it is polynomial-time solvable for (sP1 + P4)-free graphs for every s ≥ 1},
doi = {10.1016/j.tcs.2021.12.010},
issn = {0304-3975},
journal = {Theoretical Computer Science},
note = {EPrint Processing Status: Full text deposited in DRO},
pages = {76-92},
publicationstatus = {Published},
publisher = {Elsevier},
url = {https://durham-repository.worktribe.com/output/1221498},
volume = {902},
keyword = {Algorithms and Complexity in Durham (ACiD)},
year = {2022},
author = {Brettell, N. and Johnson, M. and Paesani, G. and Paulusma, D.}
}