Geodesic
A generalization of Hamiltonian cycles for trees
Czechoslovak Mathematical Journal, Tome 26 (1976) no. 4, pp. 596-603
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1976.101430
Classification : 05C05, 05C35 
@article{10_21136_CMJ_1976_101430,
     author = {Nebesk\'y, Ladislav},
     title = {A generalization of {Hamiltonian} cycles for trees},
     journal = {Czechoslovak Mathematical Journal},
     pages = {596--603},
     year = {1976},
     volume = {26},
     number = {4},
     doi = {10.21136/CMJ.1976.101430},
     mrnumber = {0543670},
     zbl = {0365.05030},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1976.101430/}
}
TY  - JOUR
AU  - Nebeský, Ladislav
TI  - A generalization of Hamiltonian cycles for trees
JO  - Czechoslovak Mathematical Journal
PY  - 1976
SP  - 596
EP  - 603
VL  - 26
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1976.101430/
DO  - 10.21136/CMJ.1976.101430
LA  - en
ID  - 10_21136_CMJ_1976_101430
ER  - 
%0 Journal Article
%A Nebeský, Ladislav
%T A generalization of Hamiltonian cycles for trees
%J Czechoslovak Mathematical Journal
%D 1976
%P 596-603
%V 26
%N 4
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1976.101430/
%R 10.21136/CMJ.1976.101430
%G en
%F 10_21136_CMJ_1976_101430
Nebeský, Ladislav. A generalization of Hamiltonian cycles for trees. Czechoslovak Mathematical Journal, Tome 26 (1976) no. 4, pp. 596-603. doi: 10.21136/CMJ.1976.101430

[1] M. Behzad K. Chartrand: Introduction to the Theory of Graphs. Allyn and Bacon, Boston 1971. | MR

[2] H. Fleischner: The square of every two-connected graph is hamiltonian. J. of Combinatorial Theory Ser. В 16 (1974), 29-34. | DOI | MR | Zbl

[3] L. Nebeský: Algebraic Properties of Trees. Charles University, Praha 1969. | MR

[4] F. Neuman: On a certain ordering of the vertices of a tree. Čas. pěst. mat. 89 (1964), 323 - 339. | MR | Zbl

[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. | MR | Zbl

Cité par Sources :