𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Disjoint Paths in Graphs I,¶3-planar Graphs and Basic Obstructions

✍ Scribed by Xingxing Yu

Book ID
120770427
Publisher
Springer
Year
2003
Tongue
English
Weight
268 KB
Volume
7
Category
Article
ISSN
0218-0006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Infinite paths in planar graphs V, 3-ind
Infinite paths in planar graphs V, 3-indivisible graphs
✍ Xingxing Yu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 583 KB

## Abstract We prove Nash‐Williams' conjecture that every 4‐connected, 3‐indivisible, infinite, planar graph contains a spanning 2‐way infinite path. A graph is said to be 3‐indivisible if the deletion of any finite set of vertices results in at most two infinite components. © 2007 Wiley Periodical

Infinite paths in planar graphs I: Graph
Infinite paths in planar graphs I: Graphs with radial nets
✍ Xingxing Yu 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 234 KB 👁 1 views

## Abstract Let __G__ be an infinite 4‐connected planar graph such that the deletion of any finite set of vertices from __G__ results in exactly one infinite component. Dean __et al__. proved that either __G__ admits a radial net or a special subgraph of __G__ admits a ladder net, and they used the