Chords of longest circuits in 3-connected graphs
A conjecture of Thomassen says that every longest circuit of a 3-connected graph has a chord. This paper shows this to be true for a 3-connected graph embedded in a projective plane, having minimum degree 4.
scientific article; zbMATH DE number 1956039