About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

Vacek, Pavel
Bounds of lengths of open Hamiltonian walks. (English). Archivum Mathematicum, vol. 28 (1992), issue 1, pp. 11-16
MSC: 05C38, 05C45 | MR 1201861 | Zbl 0782.05056
Keywords:
graph; tree; Hamiltonian path; open Hamiltonian walk; diameter of graph
Summary:
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.
References:
[1] Bermond J.C.: On Hamiltonian walks. Proc. 5th British combinatorial conf. (1975), 41-51. MR 0398891
[2] Goodman S.E. and Hedetniemi S.T.: On Hamiltonian walks in graphs. SIAM J. Comput 3 (1974), 214-221. MR 0432492
[3] Jolivet J.L.: Hamiltonian pseudocycles in graphs. Proc. 5th Conf. Combinatorics, graph theory and computing (1975), Boca Raton, 529-533. MR 0364009
[4] Vacek P.: On open Hamiltonian walks. in print. Zbl 0758.05067
Partner of
EuDML logo