✦ LIBER ✦

Hamiltonian paths in infinite graphs

✍ Scribed by David Harel

Book ID: 112889518
Publisher: The Hebrew University Magnes Press
Year: 1991
Tongue: English
Weight: 792 KB
Volume: 76
Category: Article
ISSN: 0021-2172
DOI: 10.1007/bf02773868

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

One-way infinite hamiltonian paths in in

One-way infinite hamiltonian paths in infinite maximal planar graphs

✍ H. -O. Jung 📂 Article 📅 1994 🏛 Vandenhoeck & Ruprecht 🌐 German ⚖ 477 KB

Hamiltonian paths and hamiltonian connec

Hamiltonian paths and hamiltonian connectivity in graphs

✍ Bing Wei 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 388 KB

## Let G be a 2-connected graph with n vertices such that d(u)+d(u)+d(w)-IN(u)nN(u)nN(w)I an+ 1 holds for any triple of independent vertices u, v and w. Then for any distinct vertices u and u such that {u, 0) is not a cut vertex set of G, there is a hamiltonian path between u and o. In particular,

Hamiltonian paths in oriented graphs

✍ Maria Overbeck-Larisch 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 217 KB

Hamiltonian path graphs

✍ Gary Chartrand; S. F. Kapoor; E. A. Nordhaus 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 389 KB

## Abstract The Hamiltonian path graph __H(G)__ of a graph __G__ is that graph having the same vertex set as __G__ and in which two vertices __u__ and __v__ are adjacent if and only if __G__ contains a Hamiltonian __u‐v__ path. A characterization of Hamiltonian graphs isomorphic to their Hamiltonia

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

Infinite Hamiltonian paths in Cayley dig

Infinite Hamiltonian paths in Cayley digraphs

✍ Irwin L Jungreis 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 942 KB

Let Cay(S : H) be the Cayley digraph of the generators S in the group H. A one-way infinite Hamiltonian path in the digraph G is a listing of all the vertices [q: 1 ~< i <oo], such that there is an arc from vi to vi+ 1. A two-way infinite Hamiltonian path is similarly defined, with i ranging from -0