If $G$ is a graph, an open Hamiltonian walk is any open sequence of edges of minimal length which includes every vertex of $G$. In this paper bounds of lengths of open Hamiltonian walks are studied.
@article{107431,
author = {Pavel Vacek},
title = {Bounds of lengths of open Hamiltonian walks},
journal = {Archivum Mathematicum},
volume = {028},
year = {1992},
pages = {11-16},
zbl = {0782.05056},
mrnumber = {1201861},
language = {en},
url = {http://dml.mathdoc.fr/item/107431}
}
Vacek, Pavel. Bounds of lengths of open Hamiltonian walks. Archivum Mathematicum, Tome 028 (1992) pp. 11-16. http://gdmltest.u-ga.fr/item/107431/
On Hamiltonian walks, Proc. 5th British combinatorial conf. (1975), 41-51. (1975) | MR 0398891
On Hamiltonian walks in graphs, SIAM J. Comput 3 (1974), 214-221. (1974) | MR 0432492
Hamiltonian pseudocycles in graphs, Proc. 5th Conf. Combinatorics, graph theory and computing (1975), Boca Raton, 529-533. (1975) | MR 0364009
On open Hamiltonian walks, in print. | Zbl 0758.05067