AbstractMaximumG edge-packing is the problem of finding the maximum number of edge-disjoint isomorphic copies of a fixed guest graphG in a host graphH. This paper considers the cases whereG andH are planar andG 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
AbstractLet G1 and G2 be graphs with n vertices. If there are edge-disjoint copies of G1 and G1 with...
This paper addresses upper and lower bounds for the cardinality of a maximum vertex-/edge-disjoint c...
For a graph G let \mu (G) denote the cyclomatic number and let \nu (G) denote the maximum number of ...
AbstractMaximumG edge-packing is the problem of finding the maximum number of edge-disjoint isomorph...
Maximum G Edge-Packing is the problem of finding the maximum number of edge-disjoint isomorphic copi...
Maximum G Edge-Packing (EPackG) is the problem of finding the maximum number of edge-disjoint isomor...
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...
Abstract. Graph packing and partitioning problems have been studied in many contexts, includ-ing fro...
We devise constant-factor approximation algorithms for finding as many disjoint cycles as possible f...
AbstractIn this paper we study two types of edge-disjoint packings of graphs. The induced edge-disjo...
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...
A graph consists of a set of vertices (nodes) and a set of edges (line connecting vertices). Two gra...
This paper addresses upper and lower bounds for the cardinality of a maximum vertex-/edge-disjoint c...
AbstractLet G1 and G2 be graphs with n vertices. If there are edge-disjoint copies of G1 and G1 with...
This paper addresses upper and lower bounds for the cardinality of a maximum vertex-/edge-disjoint c...
For a graph G let \mu (G) denote the cyclomatic number and let \nu (G) denote the maximum number of ...
AbstractMaximumG edge-packing is the problem of finding the maximum number of edge-disjoint isomorph...
Maximum G Edge-Packing is the problem of finding the maximum number of edge-disjoint isomorphic copi...
Maximum G Edge-Packing (EPackG) is the problem of finding the maximum number of edge-disjoint isomor...
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...
Abstract. Graph packing and partitioning problems have been studied in many contexts, includ-ing fro...
We devise constant-factor approximation algorithms for finding as many disjoint cycles as possible f...
AbstractIn this paper we study two types of edge-disjoint packings of graphs. The induced edge-disjo...
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...
A graph consists of a set of vertices (nodes) and a set of edges (line connecting vertices). Two gra...
This paper addresses upper and lower bounds for the cardinality of a maximum vertex-/edge-disjoint c...
AbstractLet G1 and G2 be graphs with n vertices. If there are edge-disjoint copies of G1 and G1 with...
This paper addresses upper and lower bounds for the cardinality of a maximum vertex-/edge-disjoint c...
For a graph G let \mu (G) denote the cyclomatic number and let \nu (G) denote the maximum number of ...
DOI
Add to ORKG