@article{ARM_1991_27_1-2_a12,
author = {Vacek, Pavel},
title = {On open {Hamiltonian} walks in graphs},
journal = {Archivum mathematicum},
pages = {105--111},
year = {1991},
volume = {27},
number = {1-2},
mrnumber = {1189647},
zbl = {0758.05067},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ARM_1991_27_1-2_a12/}
}
Vacek, Pavel. On open Hamiltonian walks in graphs. Archivum mathematicum, Tome 27 (1991) no. 1-2, pp. 105-111. http://geodesic.mathdoc.fr/item/ARM_1991_27_1-2_a12/
[1] J. C. Bermond: On Hamiltonian walks. Proc. 5th British combinatorial conf., 1975, 41-51. | MR
[2] G. A. Dirac: Path and circuits in graphs: Extreme cases. Acta math. acad. sci. hung., 10 (1959), 357-362. | MR
[3] G. A. Dirac: On Hamilton circuits and Hamilton paths. Math. Ann., 197 (1972), 57-70. | MR
[4] G. A. Dirac: Note on Hamilton circuits and Hamilton paths. Math. Ann., 206 (1973), 139-147. | MR | Zbl
[5] P. Eгdös, T. Gallai: On maximal paths and circuits of graphs. Acta math. acad. sci hung., 10(1959), 337-356. | MR
[6] S. E. Goodman, S. T. Hedetniemi: On Hamiltonian walks in graphs. SIAM J. Comput., 3 (1974), 214-221. | MR | Zbl
[7] J. L. Jolivet: Hamiltonian pseudocycles in graphs. Proc. 5th Conf. Combinatorics, graph theory and computing, Boca Raton, 1975, 529-533. | MR
[8] O. Ore: On a graph theorem by Dirac. Journal of Combinatorial theoгy, 2 (1967), 383-392. | MR | Zbl
[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