Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs

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 both problems are polynomial-time solvable for sP3-free graphs for every integer s ≥ 1; here, the graph sP3 denotes the disjoint union of s paths on three vertices. Our results show that both problems exhibit the same behaviour on H-free graphs (subject to some open cases). This is in part explained by a new general algorithm we design for finding in a graph G a largest induced subgraph whose blocks belong to some finite class 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. 2012 ACM Subject Classification Mathematics of computing → Graph algorithms

[1]  Fahad Panolan,et al.  Quick but Odd Growth of Cacti , 2017, Algorithmica.

[2]  Andreas Brandstädt,et al.  Maximum weight independent set for ℓclaw-free graphs in polynomial time , 2016, Discret. Appl. Math..

[3]  D. Paulusma,et al.  Computing Subset Transversals in H-Free Graphs , 2020, WG.

[4]  Saket Saurabh,et al.  Parameterized Algorithms for Even Cycle Transversal , 2012, WG.

[5]  Andrea Munaro,et al.  On line graphs of subcubic triangle-free graphs , 2017, Discret. Math..

[6]  Paul D. Seymour,et al.  Induced subgraphs of bounded treewidth and the container method , 2020, SODA.

[7]  Dániel Marx,et al.  Parameterized vertex deletion problems for hereditary graph classes with a block property , 2016, WG.

[8]  Andreas Brandstädt,et al.  On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem , 2005, Theor. Comput. Sci..

[9]  Marcin Pilipczuk,et al.  Finding large induced sparse subgraphs in c>t -free graphs in quasipolynomial time , 2020, STOC.

[10]  O-joung Kwon,et al.  Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth , 2020, IPEC.

[11]  Michal Pilipczuk,et al.  Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs , 2019, SODA.

[12]  Daniël Paulusma,et al.  On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest , 2019, FCT.

[13]  Daniel Lokshtanov,et al.  Independent Set in P5-Free Graphs in Polynomial Time , 2014, SODA.

[14]  Andreas Brandst.  On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem , 2007 .

[15]  Yota Otachi,et al.  An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion , 2020, ArXiv.

[16]  Bruno Courcelle,et al.  Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach , 2012, Encyclopedia of mathematics and its applications.

[17]  Daniël Paulusma,et al.  Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity , 2017, Theor. Comput. Sci..

[18]  Nick Brettell,et al.  Computing Weighted Subset Transversals in H-Free Graphs , 2021, WADS.

[19]  Daniël Paulusma,et al.  Connected Vertex Cover for (sP1+P5)-Free Graphs , 2017, ArXiv.

[20]  Dieter Kratsch,et al.  On the restriction of some NP-complete graph problems to permutation graphs , 1985, FCT.

[21]  S. Poljak.  A note on stable sets and colorings of graphs , 1974 .