Bounds of lengths of open Hamiltonian walks
Archivum mathematicum, Tome 28 (1992) no. 1-2, pp. 11-16
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
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.
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.
Classification :
05C38, 05C45
Keywords: graph; tree; Hamiltonian path; open Hamiltonian walk; diameter of graph
Keywords: graph; tree; Hamiltonian path; open Hamiltonian walk; diameter of graph
@article{ARM_1992_28_1-2_a2,
author = {Vacek, Pavel},
title = {Bounds of lengths of open {Hamiltonian} walks},
journal = {Archivum mathematicum},
pages = {11--16},
year = {1992},
volume = {28},
number = {1-2},
mrnumber = {1201861},
zbl = {0782.05056},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ARM_1992_28_1-2_a2/}
}
Vacek, Pavel. Bounds of lengths of open Hamiltonian walks. Archivum mathematicum, Tome 28 (1992) no. 1-2, pp. 11-16. http://geodesic.mathdoc.fr/item/ARM_1992_28_1-2_a2/
[1] Bermond J.C.: On Hamiltonian walks. Proc. 5th British combinatorial conf. (1975), 41-51. | MR
[2] Goodman S.E. and Hedetniemi S.T.: On Hamiltonian walks in graphs. SIAM J. Comput 3 (1974), 214-221. | MR
[3] Jolivet J.L.: Hamiltonian pseudocycles in graphs. Proc. 5th Conf. Combinatorics, graph theory and computing (1975), Boca Raton, 529-533. | MR
[4] Vacek P.: On open Hamiltonian walks. in print. | Zbl