Skip to main content
Log in

Advances on the Hamiltonian Problem – A Survey

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: April 2, 2002 Final version received: July 8, 2002

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-002-0492-x

Keywords

Navigation