✦ LIBER ✦

Edge-disjoint odd cycles in planar graphs

✍ Scribed by Daniel Král’; Heinz-Jürgen Voss

Book ID: 108395409
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 277 KB
Volume: 90
Category: Article
ISSN: 0095-8956
DOI: 10.1016/s0095-8956(03)00078-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-disjoint Hamilton cycles in 4-regul

Edge-disjoint Hamilton cycles in 4-regular planar graphs

✍ J. A. Bondy; R. Häggkvist 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 179 KB

Edge disjoint cycles in graphs

✍ Li Hao 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 419 KB

Edge disjoint Hamilton cycles in graphs

✍ Guojun Li 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 2 views

Edge-disjoint Hamilton cycles in graphs

✍ Demetres Christofides; Daniela Kühn; Deryk Osthus 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 464 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

Edge-disjoint paths in planar graphs

✍ András Frank 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 989 KB