On Hamiltonian cycles of complete $n$-partite graphs
Mathematica slovaca, Tome 29 (1979) no. 1, pp. 43-47
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C30, 05C45
@article{MASLO_1979_29_1_a4,
     author = {Hor\'ak, Peter and Tov\'arek, Leo\v{s}},
     title = {On {Hamiltonian} cycles of complete $n$-partite graphs},
     journal = {Mathematica slovaca},
     pages = {43--47},
     year = {1979},
     volume = {29},
     number = {1},
     mrnumber = {561775},
     zbl = {0401.05054},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1979_29_1_a4/}
}
TY  - JOUR
AU  - Horák, Peter
AU  - Továrek, Leoš
TI  - On Hamiltonian cycles of complete $n$-partite graphs
JO  - Mathematica slovaca
PY  - 1979
SP  - 43
EP  - 47
VL  - 29
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/MASLO_1979_29_1_a4/
LA  - en
ID  - MASLO_1979_29_1_a4
ER  - 
%0 Journal Article
%A Horák, Peter
%A Továrek, Leoš
%T On Hamiltonian cycles of complete $n$-partite graphs
%J Mathematica slovaca
%D 1979
%P 43-47
%V 29
%N 1
%U http://geodesic.mathdoc.fr/item/MASLO_1979_29_1_a4/
%G en
%F MASLO_1979_29_1_a4
Horák, Peter; Továrek, Leoš. On Hamiltonian cycles of complete $n$-partite graphs. Mathematica slovaca, Tome 29 (1979) no. 1, pp. 43-47. http://geodesic.mathdoc.fr/item/MASLO_1979_29_1_a4/

[1] HARARY F.: Graph theory. Addison-Wesley, Reading, 1969. | MR | Zbl

[2] KORSHUNOV A. D., NINČÁK J.: The number of hamiltonian cycles in complete k-partite graphs. Čas. Pěst. Mat. (to appear).

[3] PÓSA L.: A theorem conceгning Hamilton lines. Magyar Tud. Aкad. Mat. Kutató Int. Közl., 7, 1962, 225-226. | MR

[4] VRBA A.: Counting hamiltonian circuits. Graphs, hypergraphs and blocк systems, Proc. Symp. Zielona Góra 1976, 57-68. | Zbl