On perfect one-factorization of the complete graphK2p
Anderson [1, 2] and Nakamura  have constructed perfect 1-factorizations ofK2p independently, wherep is an odd prime. In this paper, we show that these two 1-factorizations are isomorphic.
- 1.Anderson, B.A.: Finite topologies and Hamiltonian path. J. Comb. Theory (B)14, 87–93 (1973)Google Scholar
- 2.Anderson, B.A.: Symmetry groups of some perfect 1-factorizations of complete graphs. Discrete Math.18, 227–234 (1977)Google Scholar
- 3.Dinits, J.H., Stinson, D.R.: Some new perfect 1-factorizations from starters in finite fields. Institute for Mathematics and its Applications, University of Minnesota, IMA Preprint Series #450Google Scholar
- 4.Nakamura, G.: Dudney's round table problem and the edge-coloring of the complete graph (in Japanese). Sūgaku Seminar No. 159, 24–29 (1975)Google Scholar
© Springer-Verlag 1989