P3-factorization of complete multipartite graphs

Kazuhiko Ushio; Reiji Tsuruno

doi:10.1007/BF01788695

P₃-factorization of complete multipartite graphs

Kazuhiko Ushio, Reiji Tsuruno

研究成果: Contribution to journal › Article › 査読

22 被引用数 (Scopus)

抄録

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

本文言語	英語
ページ（範囲）	385-387
ページ数	3
ジャーナル	Graphs and Combinatorics
巻	5
号	1
DOI	https://doi.org/10.1007/BF01788695
出版ステータス	出版済み - 12 1989
外部発表	はい

All Science Journal Classification (ASJC) codes

理論的コンピュータサイエンス
離散数学と組合せ数学

文献へのアクセス

10.1007/BF01788695

他のファイルとリンク

引用スタイル

@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 = dec,

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 -