Path factorizations of complete multipartite graphs

DOI10.1016/S0012-365X(98)00176-9zbMath0930.05078WikidataQ114122931 ScholiaQ114122931MaRDI QIDQ1296982

P. Paulraja, Appu Muthusamy

Publication date: 9 February 2000

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

zbMATH Keywords

pathfactorizationcomplete graph

Mathematics Subject Classification ID

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

Related Items (1)

P₃-factorization of triangulated Cartesian product of complete graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(P_{2p}\)-factorization of a complete bipartite graph
• 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
• On path factorizations of complete multipartite graphs
• \(G\)-designs and related designs

This page was built for publication: Path factorizations of complete multipartite graphs