𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Disjoint minimal graphs

✍ Scribed by Vladimir G. Tkachev

Publisher
Springer
Year
2008
Tongue
English
Weight
217 KB
Volume
35
Category
Article
ISSN
0232-704X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Disjoint matchings of graphs
Disjoint matchings of graphs
✍ Kenneth Lebensold πŸ“‚ Article πŸ“… 1977 πŸ› Elsevier Science 🌐 English βš– 250 KB
Minimal graphs
Minimal graphs
✍ James Eells πŸ“‚ Article πŸ“… 1979 πŸ› Springer 🌐 English βš– 207 KB
Edge disjoint cycles in graphs
Edge disjoint cycles in graphs
✍ Li Hao πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 419 KB
Edge-disjoint maximal planar graphs
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

Edge-disjoint packings of graphs
Edge-disjoint packings of graphs
✍ Derek G. Corneil; Shigeru Masuyama; S. Louis Hakimi πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 941 KB