✦ LIBER ✦

One-way infinite hamiltonian paths in infinite maximal planar graphs

✍ Scribed by H. -O. Jung

Book ID: 112946288
Publisher: Vandenhoeck & Ruprecht
Year: 1994
Tongue: German
Weight: 477 KB
Volume: 64
Category: Article
ISSN: 0025-5858
DOI: 10.1007/bf02940781

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Infinite paths in planar graphs III, 1-w

Infinite paths in planar graphs III, 1-way infinite paths

✍ Xingxing Yu 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 336 KB

An infinite graph is 2-indivisible if the deletion of any finite set of vertices from the graph results in exactly one infinite component. Let G be a 4-connected, 2-indivisible, infinite, plane graph. It is known that G contains a spanning 1-way infinite path. In this paper, we prove a stronger resu

Hamiltonian paths in infinite graphs

✍ David Harel 📂 Article 📅 1991 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 792 KB

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

On k-path hamiltonian maximal planar gra

On k-path hamiltonian maximal planar graphs

✍ İlker Baybars 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 239 KB

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 IV, divi

Infinite paths in planar graphs IV, dividing cycles

✍ Xingxing Yu 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 285 KB 👁 1 views

Nash-Williams conjectured that a 4-connected infinite planar graph contains a spanning 2-way infinite path if, and only if, the deletion of any finite set of vertices results in at most two infinite components. In this article, we prove this conjecture for graphs with no dividing cycles and for grap