Cycles with a chord in dense graphs
From MaRDI portal
Publication:1637124
DOI10.1016/J.DISC.2018.04.016zbMATH Open1388.05104OpenAlexW2804744393WikidataQ129811906 ScholiaQ129811906MaRDI QIDQ1637124FDOQ1637124
Authors: Guantao Chen, Ronald Gould, Xiaofeng Gu, Akira Saito 
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
Recommendations
Cites Work
- Pancyclic graphs. I
- Graphs \& digraphs
- A sufficient condition for all short cycles
- Title not available (Why is that?)
- Weakly pancyclic graphs
- Cycles in graphs. (Workshop Cycles in Graphs held at Simon Fraser University, Burnaby, British Columbia, Canada, July 5 - August 20, 1982)
- Independent dominating sets and a second hamiltonian cycle in regular graphs
- Chords in longest cycles
- A note on extending Bondy's meta-conjecture
- Degree conditions for Hamiltonicity: counting the number of missing edges
Cited In (11)
- Chorded pancyclic properties in claw-free graphs
- Results and problems on chorded cycles: a survey
- Directed cycles with two chords and strong spanning directed subgraphs with few arcs
- Chorded pancyclicity in \(k\)-partite graphs
- Title not available (Why is that?)
- A note on extending Bondy's meta-conjecture
- Cycle factors in dense graphs
- Extending vertex and edge pancyclic graphs
- Chorded pancyclicity with distance two degree condition and doubly chorded pancyclicity
- Cycles of Given Size in a Dense Graph
- Pancyclicity when each cycle contains \(k\) chords
This page was built for publication: Cycles with a chord in dense graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1637124)
