𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edge-Packing in Planar Graphs

✍ Scribed by L. S. Heath; J. P. C. Vergara

Publisher
Springer
Year
1998
Tongue
English
Weight
396 KB
Volume
31
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Edge-packing planar graphs by cyclic gra
Edge-packing planar graphs by cyclic graphs
✍ Lenwood S. Heath; John Paul C. Vergara πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 749 KB

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

Packing paths in planar graphs
Packing paths in planar graphs
✍ AndrΓ‘s Frank πŸ“‚ Article πŸ“… 1990 πŸ› Springer-Verlag 🌐 English βš– 355 KB
Packing problems in edge-colored graphs
Packing problems in edge-colored graphs
✍ P. Hell; Y. Manoussakis; Zs. Tuza πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 909 KB
Packing trees into planar graphs
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

Edge-transitive planar graphs
Edge-transitive planar graphs
✍ Branko GrΓΌnbaum; G. C. Shephard πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 590 KB