✦ LIBER ✦

Graphs with 1-Hamiltonian-connected cubes

✍ Scribed by Linda Lesniak

Book ID: 103501291
Publisher: Elsevier Science
Year: 1973
Tongue: English
Weight: 344 KB
Volume: 14
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(73)90058-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian-connected graphs

✍ Zhao Kewen; Hong-Jian Lai; Ju Zhou 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 258 KB

On hamiltonian-connected graphs

✍ Ronald J. Gould; Xingxing Yu 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 735 KB

## Abstract One of the most fundamental results concerning paths in graphs is due to Ore: In a graph __G__, if deg __x__ + deg __y__ ≧ |__V__(__G__)| + 1 for all pairs of nonadjacent vertices __x, y__ ≅ __V__(__G__), then __G__ is hamiltonian‐connected. We generalize this result using set degrees.

The 2-hamiltonian cubes of graphs

✍ K. M. Koh; K. L. Teo 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 450 KB

Hamiltonian properties of the cube of a

Hamiltonian properties of the cube of a 2-edge connected graph

✍ M. Paoli 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 514 KB

Let G be a 2-edge connected graph with a t least 5 vertices. For any given vertices a, b, c, and din G with a # b, there exists in G3 a hamiltonian path with endpoints a and b avoiding the edge cd, and there exists in G3 U {cd} a hamiltonian path with endpoints a and b and containing the edge cd. Al

Hamiltonian Connected Claw-Free Graphs

✍ MingChu Li 📂 Article 📅 2004 🏛 Springer Japan 🌐 English ⚖ 395 KB

On Hamiltonian-connected regular graphs

✍ Ioan Tomescu 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 360 KB 👁 1 views

In this paper it is shown that any rn-regular graph of order 2rn (rn 3 3), not isomorphic to K, , , , or of order 2rn + 1 (rn even, rn 3 4), is Hamiltonian connected, which extends a previous result of Nash-Williams. As a corollary, it is derived that any such graph contains at least rn Hamiltonian