\(P_3\)-factorization of complete multipartite graphs

DOI10.1007/s11766-999-0064-4zbMath0920.05015OpenAlexW2330729555MaRDI QIDQ1288299

Beiliang Du

Publication date: 15 September 1999

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-999-0064-4

zbMATH Keywords

complete multipartite graph

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

\(P_{5}\)-factorization of complete bipartite graphs

Cites Work

• Resolvable path designs
• \(P_ 3\)-factorization of complete bipartite graphs
• \(G\)-designs and related designs
• Two new direct product‐type constructions for resolvable group‐divisible designs