Every 3-connected, essentially 11-connected line graph is Hamiltonian

Thomassen conjectured that every 4-connected line graph is hamiltonian. A vertex cut X of G is essential if G-X has at least two nontrivial components. We prove that every 3-connected, essentially 11-connected line graph is hamiltonian. Using Ryj

• Type: Journal
• Year: 2006
• Where: JCT
• Authors: Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou
• Keywords: 4-connected Line Graph, Claw-free Graph, JCT 2006, Line Graph