Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path
From MaRDI portal
Publication:2971135
DOI10.1007/978-3-319-51963-0_16zbMath1450.05051OpenAlexW2569808087MaRDI QIDQ2971135
Publication date: 4 April 2017
Published in: SOFSEM 2017: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-51963-0_16
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- A method in graph theory
- Claw-free graphs---a survey
- Advances on the Hamiltonian problem -- a survey
- Recent advances on the Hamiltonian problem: survey III
- Note on Hamilton Circuits
- Hamilton cycles in claw-free graphs
- Updating the hamiltonian problem—A survey
- Relative length of long paths and cycles in graphs with large degree sums
- Hamiltonicity for K1, r‐free graphs
- Some Theorems on Abstract Graphs
This page was built for publication: Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path