Chords of longest cycles in cubic graphs (Q1386433)

The author determines a condition which is sufficient to guarantee the existence of a second Hamilton cycle in a Hamiltonian graph. He uses this to prove that every longest cycle in a 3-connected cubic graph has a chord, and other results on the existence of a second Hamilton cycle.