✦ LIBER ✦

Disjoint edges in geometric graphs

✍ Scribed by N. Alon; P. Erdös

Publisher: Springer
Year: 1989
Tongue: English
Weight: 235 KB
Volume: 4
Category: Article
ISSN: 0179-5376
DOI: 10.1007/bf02187731

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Geometric Graphs with Few Disjoint Edges

✍ G. Tóth; P. Valtr 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 138 KB

Geometric Graphs with No Three Disjoint

Geometric Graphs with No Three Disjoint Edges

✍ Jakub Cerny 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 233 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 paths in planar graphs

✍ András Frank 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 989 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