Every longest circuit of a 3‐connected,K3,3‐minor free graph has a chord |
| |
| Authors: | Etienne Birmelé |
| |
| Institution: | Laboratoire Statistique et Génome, Université D'Evry, UMR CNRS 8071, INRA 1152, Tour Evry 2, 523 Place des Terrasses de L'Agora, 91034 Evry Cedex, France |
| |
| 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 |
| |
| Keywords: | longest circuit 3‐connected minor |
|
|
