Now showing items 1-1 of 1
Edge-Packing Planar Graphs by Cyclic Graphs
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1996-11-01), TR-96-15
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. ...