Gao, Jingzhen Studying methods for the Hamiltonian problem in graphs. (Chinese. English summary) Zbl 0934.05085 J. Qufu Norm. Univ., Nat. Sci. 21, No. 5, 13-16 (1995). 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 Keywords:longest cycle; Hamiltonian problem; longest path; hopping lemma; dominating cycles PDFBibTeX XMLCite \textit{J. Gao}, J. Qufu Norm. Univ., Nat. Sci. 21, No. 5, 13--16 (1995; Zbl 0934.05085)