[1] J. C. Bermond: On Hamiltonian walks. Proc. 5th British combinatorial conf., 1975, 41-51. MR 0398891

[2] G. A. Dirac: Path and circuits in graphs: Extreme cases. Acta math. acad. sci. hung., 10 (1959), 357-362. MR 0114773

[3] G. A. Dirac: On Hamilton circuits and Hamilton paths. Math. Ann., 197 (1972), 57-70. MR 0302500

[4] G. A. Dirac: Note on Hamilton circuits and Hamilton paths. Math. Ann., 206 (1973), 139-147. MR 0323622 | Zbl 0247.05149

[5] P. Eгdös, T. Gallai: On maximal paths and circuits of graphs. Acta math. acad. sci hung., 10(1959), 337-356. MR 0114772

[6] S. E. Goodman, S. T. Hedetniemi: On Hamiltonian walks in graphs. SIAM J. Comput., 3 (1974), 214-221. MR 0432492 | Zbl 0269.05113

[7] J. L. Jolivet: Hamiltonian pseudocycles in graphs. Proc. 5th Conf. Combinatorics, graph theory and computing, Boca Raton, 1975, 529-533. MR 0364009

[8] O. Ore: On a graph theorem by Dirac. Journal of Combinatorial theoгy, 2 (1967), 383-392. MR 0211904 | Zbl 0173.26302

[9] T. Nishizeki T. Asano, T. Watanabe: An aproximation algorithm for Hamiltonion walk problem on maximal planar graphs. Discrete applied mathematics, 5 (1983), 211-222. MR 0683513