Skip to main content
SpringerLink
Log in

On perfect one-factorization of the complete graphK 2p

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Anderson [1, 2] and Nakamura [4] have constructed perfect 1-factorizations ofK 2p independently, wherep is an odd prime. In this paper, we show that these two 1-factorizations are isomorphic.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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 #450

  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 

Download references

Author information

Authors and Affiliations

  1. School of Administration and Informatics, University of Shizuoka, 422, Shizuoka, Japan

    Midori Kobayashi

Authors
  1. Midori Kobayashi
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kobayashi, M. On perfect one-factorization of the complete graphK 2p . Graphs and Combinatorics 5, 351–353 (1989). https://doi.org/10.1007/BF01788690

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01788690

Search

Navigation