P3-factorization of complete multipartite graphs

Kazuhiko Ushio, Reiji Tsuruno

Research output: Contribution to journalArticle

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

Fingerprint

Complete multipartite Graph
Factorization
Necessary Conditions
Sufficient Conditions

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this

P3-factorization of complete multipartite graphs. / Ushio, Kazuhiko; Tsuruno, Reiji.

In: Graphs and Combinatorics, Vol. 5, No. 1, 12.1989, p. 385-387.

Research output: Contribution to journalArticle

Ushio, Kazuhiko ; Tsuruno, Reiji. / P3-factorization of complete multipartite graphs. In: Graphs and Combinatorics. 1989 ; Vol. 5, No. 1. pp. 385-387.
@article{2e8b9d5072bc4a7eb4f31dc75a68db34,
title = "P3-factorization of complete multipartite graphs",
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).",
author = "Kazuhiko Ushio and Reiji Tsuruno",
year = "1989",
month = "12",
doi = "10.1007/BF01788695",
language = "English",
volume = "5",
pages = "385--387",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",
number = "1",

}

TY - JOUR

T1 - P3-factorization of complete multipartite graphs

AU - Ushio, Kazuhiko

AU - Tsuruno, Reiji

PY - 1989/12

Y1 - 1989/12

N2 - 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).

AB - 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).

UR - http://www.scopus.com/inward/record.url?scp=0038713274&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0038713274&partnerID=8YFLogxK

U2 - 10.1007/BF01788695

DO - 10.1007/BF01788695

M3 - Article

AN - SCOPUS:0038713274

VL - 5

SP - 385

EP - 387

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 1

ER -