𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Hamiltonian paths in distance graphs

✍ Scribed by Christian Löwenstein; Dieter Rautenbach; Friedrich Regen

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
270 KB
Volume
24
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 path graphs
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

Hamiltonian graphs involving distances
Hamiltonian graphs involving distances
✍ Guantao Chen; R. H. Schelp 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 368 KB

## Abstract Let __G__ be a graph of order __n__. We show that if __G__ is a 2‐connected graph and max{__d(u), d(v)__} + |__N(u)__ U __N(v)__| ≥ __n__ for each pair of vertices __u, v__ at distance two, then either __G__ is hamiltonian or G 3K~n/3~ U T~1~ U T~2~, where n  O (mod 3), and __T__~1~ a