AbstractFor each constant k, we present a linear time algorithm that, given a planar graph G, either finds a minimum odd cycle vertex transversal in G or guarantees that there is no transversal of size at most k
We initiate the study of the Bipartite Contraction problem from the perspective of parameterized com...
AbstractWe prove that Thurston's linear-time tiling algorithm can be extended to all planar graphs t...
A graph is H-free if it contains no induced subgraph isomorphic to H. We prove new complexity result...
Abstract. For each constant k, we present a linear time algorithm that, given a planar graph G, eith...
AbstractFor each constant k, we present a linear time algorithm that, given a planar graph G, either...
In the Odd Cycle Transversal (OCT) problem we are given a graph G on n vertices and an integer k, th...
Given a graph G = (V,E), an odd cycle cover is a subset of the vertices whose removal makes the grap...
AbstractWe present a linear-time algorithm that finds all edges and vertices in the intersection of ...
Let $G$ be a biconnected planar graph given together with its planar drawing. A {\em face-vertex wal...
AbstractWe prove τodd(G)⩽2νodd(G) for each planar graph G where νodd(G) is the maximum number of edg...
An induced packing of odd cycles in a graph is a packing such that there is no edge in a graph betwe...
AbstractCai and Schieber (1997) proved that bipartite graphs plus one edge can be recognized in line...
Planarity, bipartiteness and (directed) acyclicity are basic graph properties with classic linear ti...
It is well known that the celebrated Lipton-Tarjan planar separation theorem, in a combination with ...
The vertex- (resp., edge-) deletion graph bipartization problem is the problem of deleting a set of ...
We initiate the study of the Bipartite Contraction problem from the perspective of parameterized com...
AbstractWe prove that Thurston's linear-time tiling algorithm can be extended to all planar graphs t...
A graph is H-free if it contains no induced subgraph isomorphic to H. We prove new complexity result...
Abstract. For each constant k, we present a linear time algorithm that, given a planar graph G, eith...
AbstractFor each constant k, we present a linear time algorithm that, given a planar graph G, either...
In the Odd Cycle Transversal (OCT) problem we are given a graph G on n vertices and an integer k, th...
Given a graph G = (V,E), an odd cycle cover is a subset of the vertices whose removal makes the grap...
AbstractWe present a linear-time algorithm that finds all edges and vertices in the intersection of ...
Let $G$ be a biconnected planar graph given together with its planar drawing. A {\em face-vertex wal...
AbstractWe prove τodd(G)⩽2νodd(G) for each planar graph G where νodd(G) is the maximum number of edg...
An induced packing of odd cycles in a graph is a packing such that there is no edge in a graph betwe...
AbstractCai and Schieber (1997) proved that bipartite graphs plus one edge can be recognized in line...
Planarity, bipartiteness and (directed) acyclicity are basic graph properties with classic linear ti...
It is well known that the celebrated Lipton-Tarjan planar separation theorem, in a combination with ...
The vertex- (resp., edge-) deletion graph bipartization problem is the problem of deleting a set of ...
We initiate the study of the Bipartite Contraction problem from the perspective of parameterized com...
AbstractWe prove that Thurston's linear-time tiling algorithm can be extended to all planar graphs t...
A graph is H-free if it contains no induced subgraph isomorphic to H. We prove new complexity result...
DOI
Add to ORKG