Chords of longest circuits of graphs embedded in torus and Klein bottle

2003/03/26 by Xuechao Li, Cun‐Quan Zhang · 1 citation

paper · doi:10.1002/jgt.10091

Abstract

Abstract Thomassen conjectured that every longest circuit of a 3‐connected graph has a chord. It is proved in this paper that every longest circuit of a 4‐connected graph embedded in a torus or Klein bottle has a chord. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 1–23, 2003

Cited by

• Chords of longest cycles in graphs with large circumferences

Related

• Every longest circuit of a 3-connected, K_3,3-minor free graph has a chord
• Longest cycles and their chords
• A conjecture implying Thomassen's chord conjecture in graph theory
• Chords of longest cycles in graphs with large circumferences
• Chords of longest cycles passing through a specified small set