Heath, Lenwood S.Vergara, John Paul C.2013-06-192013-06-191996-11-01http://hdl.handle.net/10919/19956Maximum 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.application/postscriptenIn CopyrightTechnical reportTR-96-15http://eprints.cs.vt.edu/archive/00000454/01/NotOnline.html