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

Xuechao Li, Cun‐Quan Zhang · Journal of Graph Theory · 2003

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

Read the paper · More papers on PaperTik