Skip to main content
SpringerLink
Log in

P 3-factorization of complete multipartite graphs

  • Published:
Applied Mathematics-A Journal of Chinese Universities Aims and scope Submit manuscript

Abstract

In this note it is shown that a necessary and sufficient condition for the existence of a P 3-factorization of complete multipartite graph λK n m is (1) m≥3, (2) mn≡0 (mod 3) and (3) λ(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. Horton, J. D., Resolvable path designs, J. Combin. Theory Ser. A, 1985, 39: 117–131.

    Article  MATH  Google Scholar 

  2. Ushio, K., P 3factorization of complete bipartite graphs, Discrete Math., 1988, 72: 361–366.

    Article  MATH  Google Scholar 

  3. Rees, R. S., Two new direct product-type constructions for resolvable group-divisible designs, J. Combin. Designs, 1993 (1): 15–26.

    Article  MATH  Google Scholar 

  4. Ushio, K., G-designs and related designs, Discrete Math., 1993, 116: 299–311.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Depat. of Math, Suzhou Univ., 215006, Suzhou

    Du Beiliang

Authors
  1. Du Beiliang
    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

Beiliang, D. P 3-factorization of complete multipartite graphs. Appl. Math. Chin. Univ. 14, 122–124 (1999). https://doi.org/10.1007/s11766-999-0064-4

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11766-999-0064-4

1991 MR Subject Classification

Keywords

Search

Navigation