A conjecture generalizing Thomassen's chord conjecture in graph theory

DOI10.1007/S41980-024-00909-5MaRDI QIDQ6645202zbMATH OpenFDO

Authors Xingzhi Zhan

Publication date 28 November 2024

Published in Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S41980-024-00909-5

zbMATH Keywords

\(k\)-connected graphchord in a cyclelongest cyclelongest path

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• Hadwiger's conjecture
• On the Thomassen's conjecture
• Longest cycles and their chords
• A relationship between Thomassen's conjecture and Bondy's conjecture
• scientific article; zbMATH DE number 68340

Cites work

• A cycle of maximum order in a graph of high minimum degree has a chord
• Beautiful conjectures in graph theory
• Chords in longest cycles
• Chords of longest cycles in cubic graphs
• Cycles in graphs. (Workshop Cycles in Graphs held at Simon Fraser University, Burnaby, British Columbia, Canada, July 5 - August 20, 1982)
• Graph theory
• scientific article; zbMATH DE number 4164908 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• What is on his mind?

This page was built for publication: A conjecture generalizing Thomassen's chord conjecture in graph theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645202)