Four sufficient conditions for hamiltonian graphs
From MaRDI portal
Publication:803156
DOI10.1016/0012-365X(91)90367-BzbMath0727.05038MaRDI QIDQ803156
Publication date: 1991
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs ⋮ 2-Trees: Structural insights and the study of Hamiltonian paths
Cites Work
- Unnamed Item
- Semi-independence number of a graph and the existence of Hamiltonian circuits
- Neighbourhood unions and Hamiltonian properties in graphs
- Hamiltonism, degree sum and neighborhood intersections
- Hamiltonian properties of graphs with large neighborhood unions
- Note on Hamilton Circuits
- A new sufficient condition for hamiltonian graphs
- An improvement of fraisse's sufficient condition for hamiltonian graphs
- One sufficient condition for hamiltonian graphs
