Skip to main content
SpringerLink
Log in

P 3-factorization of complete multipartite graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

In this paper, it is shown that a necessary and sufficient condition for the existence of aP 3-factorization ofK n m is (i)mn ≡ 0(mod 3) and (ii) (m − 1)n ≡ 0(mod 4).

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. Hall, M. Jr.: Combinatorial Theory. Waltham. Mass.-Toronto. Ont.-London: Blaisdell 1967

    Google Scholar 

  2. Horton, J.D.: Resolvable path designs. J. Comb. Theory (A)39, 117–131 (1985)

    Google Scholar 

  3. Ray-Chaudhuri, D.K., Wilson, R.M.: Solution of Kirkman's schoolgirl problem. In: Combinatorics (Proc. Sympos. Pure Math. California 1968), pp. 187–203. Amer. Math. Soc. 1971

  4. Ushio, K.:P 3-factorization of complete bipartite graphs. Discrete Math.72, 361–366 (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Faculty of Science and Technology, Kinki University, 577, Osaka, Japan

    Kazuhiko Ushio & Reiji Tsuruno

Authors
  1. Kazuhiko Ushio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Reiji Tsuruno
    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

Ushio, K., Tsuruno, R. P 3-factorization of complete multipartite graphs. Graphs and Combinatorics 5, 385–387 (1989). https://doi.org/10.1007/BF01788695

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation