P3-factorization of complete multipartite graphs

Kazuhiko Ushio, Reiji Tsuruno

Research output: Contribution to journalArticlepeer-review

22 Citations (Scopus)

Abstract

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

Original languageEnglish
Pages (from-to)385-387
Number of pages3
JournalGraphs and Combinatorics
Volume5
Issue number1
DOIs
Publication statusPublished - Dec 1989
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'P<sub>3</sub>-factorization of complete multipartite graphs'. Together they form a unique fingerprint.

Cite this