Add to ORKGAbstract. Graph packing and partitioning problems have been studied in many contexts, includ-ing from the algorithmic complexity perspective. Consider the packing problem of determining whether a graph contains a spanning tree and a cycle that do not share edges. Bernáth and Király proved that this decision problem is NP-complete and asked if the same result holds when restricting to planar graphs. Similarly, they showed that the packing problem with a spanning tree and a path between two distinguished vertices is NP-complete. They also established the NP-completeness of the partitioning problem of determining whether the edge set of a graph can be partitioned into a spanning tree and a (not-necessarily spanning) tree. We prove that all t...
Abstract. We show that there is a linear-time algorithm to partition the edges of a planar graph int...
AbstractWe consider two graph invariants that are used as a measure of nonplanarity: the splitting n...
We prove that deciding whether the edge set of a graph can be partitionned into two spanning trees w...
Abstract. Graph packing and partitioning problems have been studied in many contexts, includ-ing fro...
Graph packing and partitioning problems have been studied in many contexts, including from the algor...
For a given graph G, the Separator Problem asks whether a vertex or edge set of small cardinality (o...
AbstractThis paper is mainly concerned with the computational complexity of determining whether or n...
In this paper we fix 7 types of undirected graphs: paths, paths with prescribed endvertices, circuit...
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...
AbstractIn this paper several results are proved: (1) Deciding whether a given planar graph G with m...
In this paper we fix 7 types of undirected graphs: paths, paths with prescribed endvertices, circuit...
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common ...
We consider two graph invariants that are used as a measure of nonplanarity: the splitting number of...
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common ...
Abstract. We show that there is a linear-time algorithm to partition the edges of a planar graph int...
AbstractWe consider two graph invariants that are used as a measure of nonplanarity: the splitting n...
We prove that deciding whether the edge set of a graph can be partitionned into two spanning trees w...
Abstract. Graph packing and partitioning problems have been studied in many contexts, includ-ing fro...
Graph packing and partitioning problems have been studied in many contexts, including from the algor...
For a given graph G, the Separator Problem asks whether a vertex or edge set of small cardinality (o...
AbstractThis paper is mainly concerned with the computational complexity of determining whether or n...
In this paper we fix 7 types of undirected graphs: paths, paths with prescribed endvertices, circuit...
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...
AbstractIn this paper several results are proved: (1) Deciding whether a given planar graph G with m...
In this paper we fix 7 types of undirected graphs: paths, paths with prescribed endvertices, circuit...
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common ...
We consider two graph invariants that are used as a measure of nonplanarity: the splitting number of...
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common ...
Abstract. We show that there is a linear-time algorithm to partition the edges of a planar graph int...
AbstractWe consider two graph invariants that are used as a measure of nonplanarity: the splitting n...
We prove that deciding whether the edge set of a graph can be partitionned into two spanning trees w...