Title of article
Chords of longest circuits in 3-connected graphs Original Research Article
Author/Authors
Xuechao Li، نويسنده , , Cun-Quan Zhang، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
8
From page
199
To page
206
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
Serial Year
2003
Journal title
Discrete Mathematics
Record number
949181
Link To Document