Chords of longest circuits in 3-connected graphs
X Li, CQ Zhang - Discrete mathematics, 2003 - Elsevier
X Li, CQ Zhang
Discrete mathematics, 2003•Elsevier… 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. cO 2002 Elsevier Science BV All rights reserved. … In 1987, Zhang [6] proved that
any longest circuit of a 3-connected planar graph G has a chord if G is cubic or ¿4. In 1997,
Carsten Thomassen [4] proved that every …
The conjecture is verified in this paper for projective planar graphs with minimum degree at
least 4. cO 2002 Elsevier Science BV All rights reserved. … In 1987, Zhang [6] proved that
any longest circuit of a 3-connected planar graph G has a chord if G is cubic or ¿4. In 1997,
Carsten Thomassen [4] proved that every …
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.
Elsevier
Showing the best result for this search. See all results