arXiv Analytics

Sign in

arXiv:1009.3754 [math.CO]AbstractReferencesReviewsResources

Hamilton cycles in 5-connected line graphs

Tomáš Kaiser, Petr Vrána

Published 2010-09-20, updated 2011-03-31Version 2

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.

Categories: math.CO
Subjects: 05C45
Related articles: Most relevant | Search more
arXiv:math/0508537 [math.CO] (Published 2005-08-26)
On a conjecture of Widom
arXiv:math/0501353 [math.CO] (Published 2005-01-21)
On the X=M=K Conjecture
arXiv:math/0610977 [math.CO] (Published 2006-10-31)
New results related to a conjecture of Manickam and Singhi

Links

Toolbox