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).
Similar content being viewed by others
References
Hall, M. Jr.: Combinatorial Theory. Waltham. Mass.-Toronto. Ont.-London: Blaisdell 1967
Horton, J.D.: Resolvable path designs. J. Comb. Theory (A)39, 117–131 (1985)
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
Ushio, K.:P 3-factorization of complete bipartite graphs. Discrete Math.72, 361–366 (1988)
Author information
Authors and Affiliations
Rights 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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01788695