| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657467 | Journal of Combinatorial Theory, Series B | 2006 | 6 Pages |
Abstract
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 non-trivial components. We prove that every 3-connected, essentially 11-connected line graph is Hamiltonian. Using Ryjáček's line graph closure, it follows that every 3-connected, essentially 11-connected claw-free graph is Hamiltonian.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
