Cycle Extendability of Hamiltonian Interval Graphs
From MaRDI portal
Publication:5757385
Recommendations
Cited in
(15)- Hamiltonian circuits in interval graph generalizations
- Connectivity and extendability in digraphs
- Recent advances on the Hamiltonian problem: survey III
- Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs
- Extending cycles locally to Hamilton cycles
- Cycle extensions in BIBD block-intersection graphs
- Cycle Extendability of Hamiltonian Strongly Chordal Graphs
- On the H-force number of Hamiltonian graphs and cycle extendability
- Global cycle properties in graphs with large minimum clustering coefficient
- Hamiltonian chordal graphs are not cycle extendable
- Extremal and degree conditions for path extendability in digraphs
- Cycle extendability in graphs and digraphs
- Further results on Hendry's Conjecture
- Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments
- Hamiltonian properties of locally connected graphs with bounded vertex degree
This page was built for publication: Cycle Extendability of Hamiltonian Interval Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757385)