
doi: 10.4036/iis.2001.25
The author surveys some of the classical results on Hamiltonian cycles in undirected graphs and pays particular attention to the development over the last decade. Among the subjects are: binding number, toughness, degree conditions, closure, regular graphs, and graphs on surfaces. This is intended as a supplement to the survey of \textit{R. J. Gould} [Updating the Hamiltonian problem---a survey, J. Graph Theory 15, No. 2, 121-157 (1991; Zbl 0746.05039)].
thoughness, Eulerian and Hamiltonian graphs, regular graph, closure, Hamiltonian cycles, binding number
thoughness, Eulerian and Hamiltonian graphs, regular graph, closure, Hamiltonian cycles, binding number
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
