A cycle of maximum order in a graph of high minimum degree has a chord

zbMath1376.05160MaRDI QIDQ1684648

Daniel J. Harvey

Publication date: 12 December 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i4p33

zbMATH Keywords

cyclesminimum degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Ramsey theory (05D10) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (1)

Results and problems on chorded cycles: a survey

Cites Work

• Chords in longest cycles
• Chords of longest circuits in locally planar graphs
• Chords of longest cycles in cubic graphs
• Chords of longest circuits in 3-connected graphs
• Removable edges and chords of longest cycles in 3-connected graphs
• Every longest circuit of a 3‐connected,K_3,3‐minor free graph has a chord
• Longest cycles and their chords
• Chords of longest circuits of graphs embedded in torus and Klein bottle
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A cycle of maximum order in a graph of high minimum degree has a chord