Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

Computing subset transversals in H-free graphs

Brettell, N. and Johnson, M. and Paesani, G. and Paulusma, D. (2022) 'Computing subset transversals in H-free graphs.', Theoretical Computer Science, 902 . pp. 76-92.

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

Item Type:Article
Full text:Publisher-imposed embargo until 21 December 2022.
(AM) Accepted Manuscript
Available under License - Creative Commons Attribution Non-commercial No Derivatives 4.0.
File format - PDF
(541Kb)
Status:Peer-reviewed
Publisher Web site:https://doi.org/10.1016/j.tcs.2021.12.010
Publisher statement:© 2021 This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
Date accepted:17 December 2021
Date deposited:04 January 2022
Date of first online publication:21 December 2021
Date first made open access:21 December 2022

Save or Share this output

Export:
Export
Look up in GoogleScholar