Bounds of lengths of open Hamiltonian walks

Pavel Vacek

Archivum Mathematicum (1992)

  • Volume: 028, Issue: 1-2, page 11-16
  • ISSN: 0044-8753

Abstract

top
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.

How to cite

top

Vacek, Pavel. "Bounds of lengths of open Hamiltonian walks." Archivum Mathematicum 028.1-2 (1992): 11-16. <http://eudml.org/doc/247340>.

@article{Vacek1992,
abstract = {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.},
author = {Vacek, Pavel},
journal = {Archivum Mathematicum},
keywords = {graph; tree; Hamiltonian path; open Hamiltonian walk; diameter of graph; Hamiltonian walks; bounds; sequence of edges; open walk; Hamiltonian path},
language = {eng},
number = {1-2},
pages = {11-16},
publisher = {Department of Mathematics, Faculty of Science of Masaryk University, Brno},
title = {Bounds of lengths of open Hamiltonian walks},
url = {http://eudml.org/doc/247340},
volume = {028},
year = {1992},
}

TY - JOUR
AU - Vacek, Pavel
TI - Bounds of lengths of open Hamiltonian walks
JO - Archivum Mathematicum
PY - 1992
PB - Department of Mathematics, Faculty of Science of Masaryk University, Brno
VL - 028
IS - 1-2
SP - 11
EP - 16
AB - 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.
LA - eng
KW - graph; tree; Hamiltonian path; open Hamiltonian walk; diameter of graph; Hamiltonian walks; bounds; sequence of edges; open walk; Hamiltonian path
UR - http://eudml.org/doc/247340
ER -

References

top
  1. On Hamiltonian walks, Proc. 5th British combinatorial conf. (1975), 41-51. (1975) MR0398891
  2. On Hamiltonian walks in graphs, SIAM J. Comput 3 (1974), 214-221. (1974) MR0432492
  3. Hamiltonian pseudocycles in graphs, Proc. 5th Conf. Combinatorics, graph theory and computing (1975), Boca Raton, 529-533. (1975) MR0364009
  4. On open Hamiltonian walks, in print. Zbl0758.05067

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.