Abstract.
This article is intended as a survey, updating earlier surveys in the area. For completeness of the presentation of both particular questions and the general area, it also contains material on closely related topics such as traceable, pancyclic and hamiltonian-connected graphs and digraphs.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: April 2, 2002 Final version received: July 8, 2002
Rights and permissions
About this article
Cite this article
Gould, R. Advances on the Hamiltonian Problem – A Survey. Graphs and Combinatorics 19, 7–52 (2003). https://doi.org/10.1007/s00373-002-0492-x
Issue Date:
DOI: https://doi.org/10.1007/s00373-002-0492-x