✦ LIBER ✦

Hamiltonian connected hourglass free line graphs

✍ Scribed by Li Dengxin; Hong-Jian Lai; Yehong Shao; Mingquan Zhan

Book ID: 108113840
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 148 KB
Volume: 308
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.06.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian connectedness in 4-connected

Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs

✍ MingChu Li; Xiaodong Chen; Hajo Broersma 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 227 KB 👁 1 views

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.

Hamiltonian Connected Claw-Free Graphs

✍ MingChu Li 📂 Article 📅 2004 🏛 Springer Japan 🌐 English ⚖ 395 KB

On 3-connected hamiltonian line graphs

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

Hamiltonian-connected graphs

✍ Zhao Kewen; Hong-Jian Lai; Ju Zhou 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 258 KB

Hamiltonian N2-locally connected claw-fr

Hamiltonian N2-locally connected claw-free graphs

✍ Hong-Jian Lai; Yehong Shao; Mingquan Zhan 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 63 KB 👁 1 views

A graph G is N 2 -locally connected if for every vertex v in G, the edges not incident with v but having at least one end adjacent to v in G induce a connected graph. In 1990, Ryja ´c ˇek conjectured that every 3-connected N 2 -locally connected claw-free graph is Hamiltonian. This conjecture is pro