Chords of longest cycles passing through a specified small set

DOI10.1016/J.DAM.2026.02.021MaRDI QIDQ6842191zbMATH OpenFDO

Authors Haidong Wu, Shunzhe Zhang

Publication date 19 March 2026

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2026.02.021

zbMATH Keywords

3-connectedchordslongest cyclesplanar graph

Mathematics Subject Classification ID

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

Cites work

• A cycle of maximum order in a graph of high minimum degree has a chord
• A solution to a colouring problem of P. Erdős
• Beautiful conjectures in graph theory
• Chords in longest cycles
• Chords of longest circuits in 3-connected graphs
• Chords of longest circuits in locally planar graphs
• Chords of longest circuits of graphs embedded in torus and Klein bottle
• Chords of longest cycles in cubic graphs
• Cycles containing all the odd-degree vertices
• Cycles in graphs. (Workshop Cycles in Graphs held at Simon Fraser University, Burnaby, British Columbia, Canada, July 5 - August 20, 1982)
• Every longest circuit of a 3‐connected,K_3,3‐minor free graph has a chord
• Graph theory
• scientific article; zbMATH DE number 2186979 (Why is no real title available?)
• scientific article; zbMATH DE number 4164908 (Why is no real title available?)
• scientific article; zbMATH DE number 830463 (Why is no real title available?)
• scientific article; zbMATH DE number 3241107 (Why is no real title available?)
• Long cycles through a linear forest
• Longest cycles and their chords
• Removable edges and chords of longest cycles in 3-connected graphs
• What is on his mind?

Cited in

(1)

• Chords of longest cycles in graphs with large circumferences

This page was built for publication: Chords of longest cycles passing through a specified small set

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