On path factorizations of complete multipartite graphs

DOI10.1016/0012-365X(93)90305-DzbMath0792.05114WikidataQ114215620 ScholiaQ114215620MaRDI QIDQ1313872

Min-Li Yu

Publication date: 1 March 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

factorizationcomplete multipartite graph

Mathematics Subject Classification ID

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

Related Items

On the chromatic index of path decompositions ⋮ On the existence of resolvable \((K_{3} + e)\)-group divisible designs ⋮ Domatically perfect graphs ⋮ Balanced path decomposition of λ K n,n and λ K n,n * ⋮ P₃-factorization of triangulated Cartesian product of complete graphs ⋮ Path factorizations of complete multipartite graphs

Cites Work

• P\({}_ 3\)-factorization of complete multipartite graphs
• Existence of resolvable path designs
• Resolvable path designs
• On decomposition of r-partite graphs into edge-disjoint Hamilton circuits