Title of article
Edge-packing planar graphs by cyclic graphs Original Research Article
Author/Authors
Lenwood S. Heath، نويسنده , , John Paul C. Vergara، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
12
From page
169
To page
180
Abstract
MaximumG 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.
Keywords
Planar graphs , Edge-disjoint subgraphs , Graph packing , NP-completeness , Cyclic subgraphs
Journal title
Discrete Applied Mathematics
Serial Year
1998
Journal title
Discrete Applied Mathematics
Record number
884692
Link To Document