Every longest circuit of a 3-connected, $K_{3,3}$-minor free graph has a chord

Abstract

Carsten Thomassen conjectured that every longest circuit in a 3-connected graph has a chord. We prove the conjecture for graphs having no $K_{3,3}$ minor, and consequently for planar graphs.

arXiv commentaccepted by Journal of Graph Theory

Cited by in corpus (1)

• Longest cycles and longest chordless cycles in $2$-connected graphs