Edge-Packing Planar Graphs by Cyclic Graphs

Heath, Lenwood S and Vergara, John Paul C (1996) Edge-Packing Planar Graphs by Cyclic Graphs. Technical Report ncstrl.vatech_cs//TR-96-15, Computer Science, Virginia Polytechnic Institute and State University.

Full text available as:
Postscript - Requires a viewer, such as GhostView
NotOnline.html (1556)

Abstract

Maximum 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.

Item Type:	Departmental Technical Report
Subjects:	Computer Science > Historical Collection(Till Dec 2001)
ID Code:	454
Deposited By:	User autouser
Deposited On:	05 December 2001
Alternative Locations:	URL:http://uther.dlib.vt.edu:9090/TechReports/NotOnline.html