On Hamiltonian cycles of complete $n$-partite graphs

Previous | Up | Next

Article

On Hamiltonian cycles of complete $n$-partite graphs. (English). Mathematica Slovaca, vol. 29 (1979), issue 1, pp. 43-47

MSC: 05C30, 05C45 | MR 561775 | Zbl 0401.05054

References:

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

[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 0184876

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

Partner of