Skip to main content

Research Repository

Advanced Search

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest

Dabrowski, K.K.; Feghali, C.; Johnson, M.; Paesani, G.; Paulusma, D.; Rzążewski, P.

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest Thumbnail


Authors

K.K. Dabrowski

C. Feghali

G. Paesani

P. Rzążewski



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 on (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. We also prove that the latter two problems are polynomial-time solvable on cographs; this was already known for FEEDBACK VERTEX SET and ODD CYCLE TRANSVERSAL. We complement these results by proving that ODD CYCLE TRANSVERSAL and CONNECTED ODD CYCLE TRANSVERSAL are NP-complete on (P2+P5,P6)-free graphs.

Citation

Dabrowski, K., Feghali, C., Johnson, M., Paesani, G., Paulusma, D., & Rzążewski, P. (2020). On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. Algorithmica, 82(10), 2841-2866. https://doi.org/10.1007/s00453-020-00706-6

Journal Article Type Article
Acceptance Date Mar 26, 2020
Online Publication Date Apr 29, 2020
Publication Date Jan 1, 2020
Deposit Date Mar 17, 2020
Publicly Available Date May 13, 2020
Journal Algorithmica
Print ISSN 0178-4617
Electronic ISSN 1432-0541
Publisher Springer
Peer Reviewed Peer Reviewed
Volume 82
Issue 10
Pages 2841-2866
DOI https://doi.org/10.1007/s00453-020-00706-6
Public URL https://durham-repository.worktribe.com/output/1268036

Files

Published Journal Article (Advance online version) (3.3 Mb)
PDF

Publisher Licence URL
http://creativecommons.org/licenses/by/4.0/

Copyright Statement
Advance online version This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.





You might also like



Downloadable Citations