Every longest circuit of a 3‐connected, K3,3‐minor free graph has a chord
Étienne Birmelé · Journal of Graph Theory · 2008
Abstract Carsten Thomassen conjectured that every longest circuit in a 3‐connected graph has a chord. We prove the conjecture for graphs having no K3,3 minor, and consequently for planar graphs. © 2008 Wiley Periodicals, Inc. J Graph Theory 58: 293–298, 2008