On Hamiltonian cycles of complete $n$-partite graphs
Mathematica slovaca, Tome 29 (1979) no. 1, pp. 43-47
@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/}
}
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