𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Packing paths in planar graphs

✍ Scribed by András Frank

Publisher
Springer-Verlag
Year
1990
Tongue
English
Weight
355 KB
Volume
10
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On paths in planar graphs
On paths in planar graphs
✍ Sanders, Daniel P. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB 👁 2 views

This paper generalizes a theorem of Thomassen on paths in planar graphs. As a corollary, it is shown that every 4-connected planar graph has a Hamilton path between any two specified vertices x, y and containing any specified edge other than xy.

Edge-Packing in Planar Graphs
Edge-Packing in Planar Graphs
✍ L. S. Heath; J. P. C. Vergara 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 396 KB
Spanning paths in infinite planar graphs
Spanning paths in infinite planar graphs
✍ Dean, Nathaniel; Thomas, Robin; Yu, Xingxing 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 796 KB

Let G be a 4connected infinite planar graph such that the deletion of any finite set of vertices of G results in at most one infinite component. We prove a conjecture of Nash-Williams that G has a 1 -way infinite spanning path. 0 1996 John Wiley & Sons, Inc. [7] has shown that every 4-connected fini

Packings and perfect path double covers
Packings and perfect path double covers of maximal planar graphs
✍ Karen Seyffarth 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 817 KB

Seyffarth, K., Packings and perfect path double covers of maximal planar graphs, Discrete Mathematics 117 (1993) 1833195. A maximal planar graph is a simple planar graph in which every face is a triangle, and a perfect packing of such a graph by 2-cliques and facial triangles corresponds to a parti