Document Type
Lecture
Publication Date
2-4-2004
Abstract
In 1976, Thomassen conjectured that every longest cycle in every 3-connected graph has a chord. Till now, this conjecture is still open, even for planar graphs. In this talk, we will present some related results and introduce some proof techniques. Further research problems will also be proposed.
Relational Format
presentation
Recommended Citation
Wei, Bing, "Chords in Longest Cycles of Graphs" (2004). Combinatorics Seminar. 105.
https://egrove.olemiss.edu/math_combinatorics/105
COinS
