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

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.Comment: accepted by Journal of Graph Theor