✦ LIBER ✦

On line graphs and the hamiltonian index

✍ Scribed by Ronald J. Gould

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 812 KB
Volume: 34
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(81)90058-3

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

On hamiltonian line graphs

✍ Lane Clark 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 191 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.

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.

Contractions and hamiltonian line graphs

✍ Hong-Jian Lai 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB

Using the contraction method, we find a best possible condition involving the minimum degree for a triangle-free graph to have a spanning eulerian subgraph.

On the hamiltonian index of a graph

✍ Marko LovrečičSaražin 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 217 KB

Line graphs of bipartite graphs with Ham

Line graphs of bipartite graphs with Hamiltonian paths

✍ Francis K. Bell 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB

It is shown that, if t is an integer !3 and not equal to 7 or 8, then there is a unique maximal graph having the path P t as a star complement for the eigenvalue À2: The maximal graph is the line graph of K m,m if t ¼ 2mÀ1, and of K m,m þ1 if t ¼ 2m. This result yields a characterization of L(G ) wh