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
In the FEEDBACK VERTEX SET problem, we aim to find a small set S of vertices in a graph intersecting...
In the Feedback Vertex Set problem, we aim to find a small set $S$ of vertices in a graph intersecti...
For any finite set H={H1,…,Hp} of graphs, a graph is H-subgraph-free if it does not contain any of H...
A graph is H-free if it contains no induced subgraph isomorphic to H. We prove new complexity result...
A graph is H-free if it contains no induced subgraph isomorphic to H. We prove new complexity result...
We prove new complexity results for Feedback Vertex Set and Even Cycle Transversal on H-free graphs,...
We perform a systematic study in the computational complexity of the connected variant of three rela...
We prove new complexity results for Feedback Vertex Set and Even Cycle Transversal on H-free graphs...
Within the broad field of Discrete Mathematics and Theoretical Computer Science, the theory of graph...
The NP-complete problem Feedback Vertex Set is to decide if it is possible, for a given integer k ≥...
We study the computational complexity of two well-known graph transversal problems, namely Subset Fe...
The NP-complete problem Feedback Vertex Set is that of deciding whether or not it is possible, for a...
We compare the minimum size of a vertex cover, feedback vertex set and odd cycle transversal of a g...
We compare the minimum size of a vertex cover, feedback vertex set and odd cycle transversal of a gr...
Let vc(G), fvs(G) and oct(G) denote, respectively, the size of a minimum vertex cover, minimum feedb...
In the FEEDBACK VERTEX SET problem, we aim to find a small set S of vertices in a graph intersecting...
In the Feedback Vertex Set problem, we aim to find a small set $S$ of vertices in a graph intersecti...
For any finite set H={H1,…,Hp} of graphs, a graph is H-subgraph-free if it does not contain any of H...
A graph is H-free if it contains no induced subgraph isomorphic to H. We prove new complexity result...
A graph is H-free if it contains no induced subgraph isomorphic to H. We prove new complexity result...
We prove new complexity results for Feedback Vertex Set and Even Cycle Transversal on H-free graphs,...
We perform a systematic study in the computational complexity of the connected variant of three rela...
We prove new complexity results for Feedback Vertex Set and Even Cycle Transversal on H-free graphs...
Within the broad field of Discrete Mathematics and Theoretical Computer Science, the theory of graph...
The NP-complete problem Feedback Vertex Set is to decide if it is possible, for a given integer k ≥...
We study the computational complexity of two well-known graph transversal problems, namely Subset Fe...
The NP-complete problem Feedback Vertex Set is that of deciding whether or not it is possible, for a...
We compare the minimum size of a vertex cover, feedback vertex set and odd cycle transversal of a g...
We compare the minimum size of a vertex cover, feedback vertex set and odd cycle transversal of a gr...
Let vc(G), fvs(G) and oct(G) denote, respectively, the size of a minimum vertex cover, minimum feedb...
In the FEEDBACK VERTEX SET problem, we aim to find a small set S of vertices in a graph intersecting...
In the Feedback Vertex Set problem, we aim to find a small set $S$ of vertices in a graph intersecti...
For any finite set H={H1,…,Hp} of graphs, a graph is H-subgraph-free if it does not contain any of H...