Chords of longest circuits in 3-connected graphs

Authors:
Xuechao Li;Cun-Quan Zhang
Affiliations:
Division of Academic Enhancement, The University of Georgia, 203 Milledge Hall, Athens, GA;Department of Mathematics, West Virginia University, P.O. Box 6310, Morgantown, WV
Venue:
Discrete Mathematics
Year:
2003

Citing 2
Cited 1

4-connected projective-planar graphs are Hamiltonian

Journal of Combinatorial Theory Series B
Chords of longest cycles in cubic graphs

Journal of Combinatorial Theory Series B

Chords of longest circuits in locally planar graphs

European Journal of Combinatorics

Quantified Score

Hi-index	0.06

Visualization

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.