Chords of longest circuits in 3-connected graphs

From MaRDI portal
Publication:1398264





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.











This page was built for publication: Chords of longest circuits in 3-connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1398264)