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

Konrad K. Dabrowski, Carl Feghali, Matthew Johnson +3

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 O…