✦ LIBER ✦

Collapsible graphs and Hamiltonian connectedness of line graphs

✍ Scribed by Weihua Yang; Hongjian Lai; Hao Li; Xiaofeng Guo

Book ID: 113564827
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 223 KB
Volume: 160
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.03.028

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

Hamiltonian Connectedness in Claw-Free G

Hamiltonian Connectedness in Claw-Free Graphs

✍ MingChu Li 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 115 KB

On hamiltonian line graphs

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

Cyclic and cliquewise connectedness of l

Cyclic and cliquewise connectedness of line graphs

✍ Christina Zamfirescu 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 189 KB

The connectivity and the line connectivity numbers of a graph and of its line graph are dependent on each other. Another important related notion is the cyclic connectedness, and we establish here a strong relationship between the cyclic connectivity number and the cyclic line connectivity number of

Line graphs of multigraphs and Hamilton-

Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs

✍ Zdeněk Ryjáček; Petr Vrána 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 958 KB

We introduce a closure concept that turns a claw-free graph into the line graph of a multigraph while preserving its (non-)Hamiltonconnectedness. As an application, we show that every 7-connected claw-free graph is Hamilton-connected, and we show that the well-known conjecture by Matthews and Sumner

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