Add to ORKGAbstract. We show that there is a linear-time algorithm to partition the edges of a planar graph into triangles. We show that the problem is also polynomial for toroidal graphs but NP-complete for k-planar graphs, where k> 8.
AbstractWe describe a simple way of partitioning a planar graph into three edge-disjoint forests in ...
Abstract. It is well known that the celebrated Lipton-Tarjan planar separation the-orem, in a combin...
A graph separator is a set of vertices or edges whose removal divides an input graph into components...
In this paper we give a linear algorithm to edge partition a toroidal graph, i.e., graph that can be...
Abstract. Graph packing and partitioning problems have been studied in many contexts, includ-ing fro...
Abstract. Graph packing and partitioning problems have been studied in many contexts, includ-ing fro...
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a ...
AbstractThis paper is mainly concerned with the computational complexity of determining whether or n...
A graph separator is a set of vertices or edges whose removal divides an input graph into components...
It is well known that the celebrated Lipton-Tarjan planar separation theorem, in a combination with ...
For a given graph G, the Separator Problem asks whether a vertex or edge set of small cardinality (o...
International audienceLet S = {K1,3, K3, P4} be the set of connected graphs of size 3. We study the ...
International audienceLet S = {K1,3, K3, P4} be the set of connected graphs of size 3. We study the ...
It is well known that the celebrated Lipton-Tarjan planar separation theorem, in a combination with ...
It is well known that the celebrated Lipton-Tarjan planar separation theorem, in a combination with ...
AbstractWe describe a simple way of partitioning a planar graph into three edge-disjoint forests in ...
Abstract. It is well known that the celebrated Lipton-Tarjan planar separation the-orem, in a combin...
A graph separator is a set of vertices or edges whose removal divides an input graph into components...
In this paper we give a linear algorithm to edge partition a toroidal graph, i.e., graph that can be...
Abstract. Graph packing and partitioning problems have been studied in many contexts, includ-ing fro...
Abstract. Graph packing and partitioning problems have been studied in many contexts, includ-ing fro...
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a ...
AbstractThis paper is mainly concerned with the computational complexity of determining whether or n...
A graph separator is a set of vertices or edges whose removal divides an input graph into components...
It is well known that the celebrated Lipton-Tarjan planar separation theorem, in a combination with ...
For a given graph G, the Separator Problem asks whether a vertex or edge set of small cardinality (o...
International audienceLet S = {K1,3, K3, P4} be the set of connected graphs of size 3. We study the ...
International audienceLet S = {K1,3, K3, P4} be the set of connected graphs of size 3. We study the ...
It is well known that the celebrated Lipton-Tarjan planar separation theorem, in a combination with ...
It is well known that the celebrated Lipton-Tarjan planar separation theorem, in a combination with ...
AbstractWe describe a simple way of partitioning a planar graph into three edge-disjoint forests in ...
Abstract. It is well known that the celebrated Lipton-Tarjan planar separation the-orem, in a combin...
A graph separator is a set of vertices or edges whose removal divides an input graph into components...