A cycle of maximum order in a graph of high minimum degree has a chord
From MaRDI portal
Publication:1684648
zbMath1376.05160MaRDI QIDQ1684648
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
05C35: Extremal problems in graph theory
05C38: Paths and cycles
05D10: Ramsey theory
05C45: Eulerian and Hamiltonian graphs
05C07: Vertex degrees
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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,K3,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