✦ LIBER ✦

On cubic 2-independent Hamiltonian connected graphs

✍ Scribed by Tung-Yang Ho; Chun-Nan Hung; Lih-Hsing Hsu

Publisher: Springer US
Year: 2007
Tongue: English
Weight: 822 KB
Volume: 14
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-007-9054-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Non-hamiltonian 3-connected cubic bipart

Non-hamiltonian 3-connected cubic bipartite graphs

✍ M.N Ellingham; J.D Horton 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 160 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.

On Hamiltonian-connected regular graphs

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

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

Mutually Independent Hamiltonian Connect

Mutually Independent Hamiltonian Connectivity of (n,k)-Star Graphs

✍ Selina Yo-Ping Chang; Justie Su-Tzu Juan; Cheng-Kuan Lin; Jimmy J. M. Tan; Lih-H 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 442 KB

Hamilton-Connected Cayley Graphs on Hami

Hamilton-Connected Cayley Graphs on Hamiltonian Groups

✍ Brian Alspach; Yusheng Qin 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 109 KB

It is proven that every connected Cayley graph X , of valency at least three, on a Hamiltonian group is either Hamilton laceable when X is bipartite, or Hamilton connected when X is not bipartite.

Hamiltonian cycles in 2-connected claw-f

Hamiltonian cycles in 2-connected claw-free-graphs

✍ Hao Li 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 418 KB 👁 2 views

## Abstract M. Matthews and D. Sumner have proved that of __G__ is a 2‐connected claw‐free graph of order __n__ such that δ ≧ (__n__ − 2)/3, then __G__ is hamiltonian. We prove that the bound for the minimum degree δ can be reduced to __n__/4 under the additional condition that __G__ is not in __F_