Previous |  Up |  Next

Article

Title: A generalization of Hamiltonian cycles for trees (English)
Author: Nebeský, Ladislav
Language: English
Journal: Czechoslovak Mathematical Journal
ISSN: 0011-4642 (print)
ISSN: 1572-9141 (online)
Volume: 26
Issue: 4
Year: 1976
Pages: 596-603
Summary lang: Russian
.
Category: math
.
MSC: 05C05
MSC: 05C35
idZBL: Zbl 0365.05030
idMR: MR0543670
DOI: 10.21136/CMJ.1976.101430
.
Date available: 2008-06-09T14:20:37Z
Last updated: 2020-07-28
Stable URL: http://hdl.handle.net/10338.dmlcz/101430
.
Reference: [1] M. Behzad K. Chartrand: Introduction to the Theory of Graphs.Allyn and Bacon, Boston 1971. MR 0432461
Reference: [2] H. Fleischner: The square of every two-connected graph is hamiltonian.J. of Combinatorial Theory Ser. В 16 (1974), 29-34. Zbl 0256.05121, MR 0332573, 10.1016/0095-8956(74)90091-4
Reference: [3] L. Nebeský: Algebraic Properties of Trees.Charles University, Praha 1969. MR 0274210
Reference: [4] F. Neuman: On a certain ordering of the vertices of a tree.Čas. pěst. mat. 89 (1964), 323 - 339. Zbl 0131.20901, MR 0181587
Reference: [5] M. Sekanina: On an ordering of the set of vertices of a connected graph.Publ. Fac. Sci. Univ. Brno, Czechoslovakia, No. 412 (1960), 137-142. Zbl 0118.18903, MR 0140095
.

Files

Files Size Format View
CzechMathJ_26-1976-4_7.pdf 1.140Mb application/pdf View/Open
Back to standard record
Partner of
EuDML logo