×

Studying methods for the Hamiltonian problem in graphs. (Chinese. English summary) Zbl 0934.05085

Summary: Fruitful ideas for the Hamiltonian problem in graphs are surveyed, including longest path techniques, the Airouche and Christofides 0-dual closure, the hopping lemma and dominating cycles tactics.

MSC:

05C45 Eulerian and Hamiltonian graphs
05C38 Paths and cycles
PDFBibTeX XMLCite