Hamilton cycles in 5-connected line graphs
Combinatorics
2011-04-01 v2
Abstract
A conjecture of Carsten Thomassen states that every 4-connected line graph is hamiltonian. It is known that the conjecture is true for 7-connected line graphs. We improve this by showing that any 5-connected line graph of minimum degree at least 6 is hamiltonian. The result extends to claw-free graphs and to Hamilton-connectedness.
Cite
@article{arxiv.1009.3754,
title = {Hamilton cycles in 5-connected line graphs},
author = {Tomáš Kaiser and Petr Vrána},
journal= {arXiv preprint arXiv:1009.3754},
year = {2011}
}