Hamilton cycles in 5-connected line graphs

Details Hamilton cycles in 5-connected line graphs Hamilton cycles in 5-connected line graphs

2010-09-20

arxiv.org/abs/1009.3754v2

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Hamilton cycles in 5-connected line graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hamilton cycles in 5-connected line graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hamilton cycles in 5-connected line graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-264280