Cycles with a chord in dense graphs

DOI10.1016/j.disc.2018.04.016zbMath1388.05104OpenAlexW2804744393MaRDI QIDQ1637124

Xiaofeng Gu, Akira Saito, Guantao Chen, Ronald J. Gould

Publication date: 7 June 2018

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

Full work available at URL: https://doi.org/10.1016/j.disc.2018.04.016

zbMATH Keywords

pancyclicweakly pancyclicchorded cyclechorded pancyclic

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Density (toughness, etc.) (05C42)

Related Items (5)

Unnamed Item ⋮ Chorded pancyclicity in \(k\)-partite graphs ⋮ Extending vertex and edge pancyclic graphs ⋮ Unnamed Item ⋮ Results and problems on chorded cycles: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chords in longest cycles
• Degree conditions for Hamiltonicity: counting the number of missing edges
• Cycles in graphs. (Workshop Cycles in Graphs held at Simon Fraser University, Burnaby, British Columbia, Canada, July 5 - August 20, 1982)
• A sufficient condition for all short cycles
• Independent dominating sets and a second hamiltonian cycle in regular graphs
• Weakly pancyclic graphs
• Pancyclic graphs. I

This page was built for publication: Cycles with a chord in dense graphs