Add to ORKGWe compare the minimum size of a vertex cover, feedback vertex set and odd cycle transversal of a graph with the minimum size of the corresponding variants in which the transversal must be an independent set. We investigate for which graphs H the two sizes are equal whenever the graph in question belongs to the class of H-free graphs. We find complete classifications for vertex cover and almost complete classifications for feedback vertex set and odd cycle transversal
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...
The Near-Bipartiteness problem is that of deciding whether or not the vertices of a graph can be par...
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...
Let vc(G), fvs(G) and oct(G) denote, respectively, the size of a minimum vertex cover, minimum feedb...
Let vc(G), fvs(G) and oct(G) denote, respectively, the size of a minimum vertex cover, minimum feedb...
Within the broad field of Discrete Mathematics and Theoretical Computer Science, the theory of graph...
A graph is H-free if it contains no induced subgraph isomorphic to H. We prove new complexity result...
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...
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...
An independent transversal of a graph G with a vertex partition P is an independent set of G interse...
The NP-complete problem Feedback Vertex Set is to decide if it is possible, for a given integer k ≥ ...
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...
The Near-Bipartiteness problem is that of deciding whether or not the vertices of a graph can be par...
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...
Let vc(G), fvs(G) and oct(G) denote, respectively, the size of a minimum vertex cover, minimum feedb...
Let vc(G), fvs(G) and oct(G) denote, respectively, the size of a minimum vertex cover, minimum feedb...
Within the broad field of Discrete Mathematics and Theoretical Computer Science, the theory of graph...
A graph is H-free if it contains no induced subgraph isomorphic to H. We prove new complexity result...
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...
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...
An independent transversal of a graph G with a vertex partition P is an independent set of G interse...
The NP-complete problem Feedback Vertex Set is to decide if it is possible, for a given integer k ≥ ...
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...
The Near-Bipartiteness problem is that of deciding whether or not the vertices of a graph can be par...