Previous |  Up |  Next

Article

Title: Bounds of lengths of open Hamiltonian walks (English)
Author: Vacek, Pavel
Language: English
Journal: Archivum Mathematicum
ISSN: 0044-8753 (print)
ISSN: 1212-5059 (online)
Volume: 28
Issue: 1
Year: 1992
Pages: 11-16
Summary lang: English
.
Category: math
.
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. (English)
Keyword: graph
Keyword: tree
Keyword: Hamiltonian path
Keyword: open Hamiltonian walk
Keyword: diameter of graph
MSC: 05C38
MSC: 05C45
idZBL: Zbl 0782.05056
idMR: MR1201861
.
Date available: 2008-06-06T21:04:31Z
Last updated: 2012-05-10
Stable URL: http://hdl.handle.net/10338.dmlcz/107431
.
Reference: [1] Bermond J.C.: On Hamiltonian walks.Proc. 5th British combinatorial conf. (1975), 41-51. MR 0398891
Reference: [2] Goodman S.E. and Hedetniemi S.T.: On Hamiltonian walks in graphs.SIAM J. Comput 3 (1974), 214-221. MR 0432492
Reference: [3] Jolivet J.L.: Hamiltonian pseudocycles in graphs.Proc. 5th Conf. Combinatorics, graph theory and computing (1975), Boca Raton, 529-533. MR 0364009
Reference: [4] Vacek P.: On open Hamiltonian walks.in print. Zbl 0758.05067
.

Files

Files Size Format View
ArchMathRetro_028-1992-1_3.pdf 174.9Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo