Answers are grounded in this paper and cite their sources.
Analysis reveals chords in longest cycles of cubic and connected graphs, indicating implications for graph theory hypotheses.
A long-standing conjecture of Thomassen says that every longest cycle of a $3$-connected graph has a chord. Thomassen (2018) proved that if G is a $2$-connected cubic graph, then any longest cycle must have a chord. He also showed that in any 3-connected graph with minimum degree at least four, some longest cycle must contain a chord. Harvey proved that every longest cycle has a chord for graphs with a large minimum degree. He also conjectured that any longest cycle in a 2-connected graph with minimum degree at least three has a chord. In this paper, we prove that both Thomassen's and Harvey's conjectures are true for graphs with large circumferences. We also prove a more general result for the existence of chords in longest cycles containing a linear forest.
No takes yet. Share an insight, caveat, or question.
Wu et al. (2025) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: