✦ LIBER ✦

On n-Hamiltonian line graphs

✍ Scribed by Linda Lesniak-Foster

Book ID: 103502637
Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 853 KB
Volume: 22
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(77)90071-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On hamiltonian line graphs

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

Hamiltonian line graphs

✍ Richard A. Brualdi; Robert F. Shanny 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 358 KB

## Abstract Sufficient conditions on the degrees of a graph are given in order that its line graph have a hamiltonian cycle.

On n-hamiltonian graphs

✍ Linda Lesmak 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 598 KB

On 3-connected hamiltonian line graphs

✍ Ye Chen; Suohai Fan; Hong-Jian Lai 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 223 KB

On hamiltonian line graphs and connectiv

On hamiltonian line graphs and connectivity

✍ Siming Zhan 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 444 KB

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.

On line graphs and the hamiltonian index

✍ Ronald J. Gould 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 812 KB

## An extension of CI theorem of Chamhnd and Wall is obtained and, with it, a bound on the lamiltoniau index h(G) of a connected graph G (other than a path) is determined. As a tonsequence, it is Fhown that if G is homogeneously traceable, then h(Gj ~2.