\(P_3\)-factorization of complete multipartite graphs
type: Item
instance of: scholarly article
title: \(P_3\)-factorization of complete multipartite graphs
zbMATH Open document ID: 0920.05015
author: Beiliang Du
published in: Applied Mathematics. Series B (English Edition)
publication date: 1999-09-15T00:00:00Z
review text: The author provides necessary and sufficient conditions for the existence of a \(P_3\)-factorization of the complete multipartite graph \(\lambda K^n_m\). Namely he proves such conditions are (i) \(m\geq 3\), (ii) \(mn\equiv 0\pmod 3\), and (iii) \(\lambda(m-1)n\equiv 0\pmod 4\). The proof is by construction and uses suitable resolvable group divisible designs with an even number of resolution classes.
Mathematics Subject Classification ID: 05B30
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 1286446
zbMATH Keywords: complete multipartite graph
MaRDI profile type: Publication
full work available at URL: s11766-999-0064-4
OpenAlex ID: W2330729555
cites work: Resolvable path designs
cites work: \(P_ 3\)-factorization of complete bipartite graphs
cites work: Two new direct product‐type constructions for resolvable group‐divisible designs
cites work: \(G\)-designs and related designs
DOI: 10.1007/S11766-999-0064-4
description: scientific article; zbMATH DE number 1286446