Updating the hamiltonian problem—A survey
- 1 June 1991
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 15 (2) , 121-157
- https://doi.org/10.1002/jgt.3190150204
Abstract
This is intended as a survey article covering recent developments in the area of hamiltonian graphs, that is, graphs containing a spanning cycle. This article also contains some material on related topics such as traceable, hamiltonian‐connected and pancyclic graphs and digraphs, as well as an extensive bibliography of papers in the area.Keywords
This publication has 100 references indexed in Scilit:
- Kneser's conjecture, chromatic number, and homotopyPublished by Elsevier ,2004
- A note on Hamiltonian circuitsPublished by Elsevier ,2002
- Limit Distribution for the Existence of Hamiltonian Cycles in Random Bipartite GraphsEuropean Journal of Combinatorics, 1985
- Toughness and the existence of k‐factorsJournal of Graph Theory, 1985
- On the existence of Hamiltonian cycles in a class of random graphsDiscrete Mathematics, 1983
- Almost all Regular Graphs are HamiltonianEuropean Journal of Combinatorics, 1983
- ber Hamiltonsche Kreise und unabh ngige Ecken in GraphenMonatshefte für Mathematik, 1979
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- In the square of graphs, hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent conceptsMonatshefte für Mathematik, 1976
- Every generalized Petersen graph has a Tait coloringPacific Journal of Mathematics, 1972