Previous |  Up |  Next

Article

Title: On open Hamiltonian walks in graphs (English)
Author: Vacek, Pavel
Language: English
Journal: Archivum Mathematicum
ISSN: 0044-8753 (print)
ISSN: 1212-5059 (online)
Volume: 27
Issue: 1
Year: 1991
Pages: 105-111
.
Category: math
.
MSC: 05C45
idZBL: Zbl 0758.05067
idMR: MR1189647
.
Date available: 2008-06-06T06:23:00Z
Last updated: 2012-05-09
Stable URL: http://hdl.handle.net/10338.dmlcz/107409
.
Reference: [1] J. C. Bermond: On Hamiltonian walks.Proc. 5th British combinatorial conf., 1975, 41-51. MR 0398891
Reference: [2] G. A. Dirac: Path and circuits in graphs: Extreme cases.Acta math. acad. sci. hung., 10 (1959), 357-362. MR 0114773
Reference: [3] G. A. Dirac: On Hamilton circuits and Hamilton paths.Math. Ann., 197 (1972), 57-70. MR 0302500
Reference: [4] G. A. Dirac: Note on Hamilton circuits and Hamilton paths.Math. Ann., 206 (1973), 139-147. Zbl 0247.05149, MR 0323622
Reference: [5] P. Eгdös, T. Gallai: On maximal paths and circuits of graphs.Acta math. acad. sci hung., 10(1959), 337-356. MR 0114772
Reference: [6] S. E. Goodman, S. T. Hedetniemi: On Hamiltonian walks in graphs.SIAM J. Comput., 3 (1974), 214-221. Zbl 0269.05113, MR 0432492
Reference: [7] J. L. Jolivet: Hamiltonian pseudocycles in graphs.Proc. 5th Conf. Combinatorics, graph theory and computing, Boca Raton, 1975, 529-533. MR 0364009
Reference: [8] O. Ore: On a graph theorem by Dirac.Journal of Combinatorial theoгy, 2 (1967), 383-392. Zbl 0173.26302, MR 0211904
Reference: [9] T. Nishizeki T. Asano, T. Watanabe: An aproximation algorithm for Hamiltonion walk problem on maximal planar graphs.Discrete applied mathematics, 5 (1983), 211-222. MR 0683513
.

Files

Files Size Format View
ArchMath_027-1991-1_13.pdf 750.8Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo