✦ LIBER ✦

On hamiltonian line graphs and connectivity

✍ Scribed by Siming Zhan

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 444 KB
Volume: 89
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90401-m

No coin nor oath required. For personal study only.

✦ Synopsis

A well-known conjecture of Thomassen says that every 4-connected line graph is hamiltonian. In this paper we prove that every 7-connected line graph is hamiltonian-connected.

For line graph, C. Thomassen [l] made the following conjecture.

Conjecture. Every 4-connected line graph is hamiltonian.

📜 SIMILAR VOLUMES

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.

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,

On hamiltonian line graphs

✍ Lane Clark 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

On the genus and connectivity of Hamilto

On the genus and connectivity of Hamiltonian graphs

✍ Richard A. Duke 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 675 KB

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

All 4-connected Line Graphs of Claw Free

All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected

✍ Matthias Kriesell 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 109 KB

Thomassen conjectured that every 4-connected line graph is hamiltonian. Here we shall see that 4-connected line graphs of claw free graphs are hamiltonian connected.