✦ LIBER ✦

Edge-packing planar graphs by cyclic graphs

✍ Scribed by Lenwood S. Heath; John Paul C. Vergara

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 749 KB
Volume: 81
Category: Article
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)00083-8

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Edge-Packing in Planar Graphs

✍ L. S. Heath; J. P. C. Vergara 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 396 KB

Edge-transitive planar graphs

✍ Branko Grünbaum; G. C. Shephard 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 590 KB

Packing trees into planar graphs

✍ A. García; C. Hernando; F. Hurtado; M. Noy; J. Tejel 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB

## Abstract In this study, we provide methods for drawing a tree with __n__ vertices on a convex polygon, without crossings and using the minimum number of edges of the polygon. We apply the results to obtain planar packings of two trees in some specific cases. © 2002 Wiley Periodicals, Inc. J Grap

Packing paths in planar graphs

✍ András Frank 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 355 KB

Edge-disjoint maximal planar graphs

✍ Sharon G. Boswell; Jamie Simpson 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 316 KB

We show that if n >~6m then it is possible to construct m edge-disjoint maximal planar graphs on a set of n vertices, but that it is not possible if n < 6m -1. We also show that given a pair of edge-disjoint maximal planar graphs, and a specified face in one, there exist at least three faces in the

Packing problems in edge-colored graphs

✍ P. Hell; Y. Manoussakis; Zs. Tuza 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 909 KB