A conjecture generalizing Thomassen's chord conjecture in graph theory

DOI10.1007/S41980-024-00909-5MaRDI QIDQ6645202

Xingzhi Zhan

Publication date: 28 November 2024

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Chords in longest cycles
• What is on his mind?
• Cycles in graphs. (Workshop Cycles in Graphs held at Simon Fraser University, Burnaby, British Columbia, Canada, July 5 - August 20, 1982)
• Chords of longest cycles in cubic graphs
• A cycle of maximum order in a graph of high minimum degree has a chord
• Beautiful conjectures in graph theory

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)