Add to ORKGMaximum G Edge-Packing is the problem of finding the maximum number of edge-disjoint isomorphic copies of a fixed guest graph G in a host graph H. This paper considers the cases where G and H are planar and G is cyclic. Recent work on the general problem is surveyed, inadequacies and limitations in these results are identified, and NP-completeness proofs for key cases are presented
Abstract. Graph packing and partitioning problems have been studied in many contexts, includ-ing fro...
We consider the two problems of finding the maximum number of node disjoint triangles and edge disjo...
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common ...
AbstractMaximumG edge-packing is the problem of finding the maximum number of edge-disjoint isomorph...
AbstractMaximumG edge-packing is the problem of finding the maximum number of edge-disjoint isomorph...
Maximum G Edge-Packing (EPackG) is the problem of finding the maximum number of edge-disjoint isomor...
Graph packing problem refers to the problem of finding maximum number of edge-disjoint copies of a ...
AbstractLet F be a fixed edge-colored graph. We consider the problem of packing the greatest possibl...
AbstractFor a graph G let μ(G) denote the cyclomatic number and let ν(G) denote the maximum number o...
AbstractIn this paper we study two types of edge-disjoint packings of graphs. The induced edge-disjo...
Given a graph G = (V,E), an odd cycle cover is a subset of the vertices whose removal makes the grap...
We devise constant-factor approximation algorithms for finding as many disjoint cycles as possible f...
Abstract. Graph packing and partitioning problems have been studied in many contexts, includ-ing fro...
Abstract. A maximum packing of any k-fold complete multipartite graph (where there are k edges betwe...
A graph G packs if for every induced subgraph H of G, the maximum number of vertex-disjoint cycles i...
Abstract. Graph packing and partitioning problems have been studied in many contexts, includ-ing fro...
We consider the two problems of finding the maximum number of node disjoint triangles and edge disjo...
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common ...
AbstractMaximumG edge-packing is the problem of finding the maximum number of edge-disjoint isomorph...
AbstractMaximumG edge-packing is the problem of finding the maximum number of edge-disjoint isomorph...
Maximum G Edge-Packing (EPackG) is the problem of finding the maximum number of edge-disjoint isomor...
Graph packing problem refers to the problem of finding maximum number of edge-disjoint copies of a ...
AbstractLet F be a fixed edge-colored graph. We consider the problem of packing the greatest possibl...
AbstractFor a graph G let μ(G) denote the cyclomatic number and let ν(G) denote the maximum number o...
AbstractIn this paper we study two types of edge-disjoint packings of graphs. The induced edge-disjo...
Given a graph G = (V,E), an odd cycle cover is a subset of the vertices whose removal makes the grap...
We devise constant-factor approximation algorithms for finding as many disjoint cycles as possible f...
Abstract. Graph packing and partitioning problems have been studied in many contexts, includ-ing fro...
Abstract. A maximum packing of any k-fold complete multipartite graph (where there are k edges betwe...
A graph G packs if for every induced subgraph H of G, the maximum number of vertex-disjoint cycles i...
Abstract. Graph packing and partitioning problems have been studied in many contexts, includ-ing fro...
We consider the two problems of finding the maximum number of node disjoint triangles and edge disjo...
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common ...