Title of article :
Chords of longest circuits in 3-connected graphs Original Research Article
Author/Authors :
Xuechao Li، نويسنده , , Cun-Quan Zhang، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2003
Abstract :
Thomassen conjectured that every longest circuit of a 3-connected graph has a chord. The conjecture is verified in this paper for projective planar graphs with minimum degree at least 4.
Keywords :
Longest circuit , Chord , Projective plane
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
