Complete multipartite decompositions of complete graphs and complete \(n\)-partite graphs

DOI10.1007/S11766-003-0061-YzbMath1112.05319OpenAlexW2046739700MaRDI QIDQ1430968

Qingxue Huang

Publication date: 27 May 2004

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

Full work available at URL: https://doi.org/10.1007/s11766-003-0061-y

Mathematics Subject Classification ID

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

Cites Work

• On biclique partitions of the complete graph
• A new proof of a theorem of Graham and Pollak
• On biclique decompositions of complete \(t\)-partite graphs
• Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs
• On the decomposition ofkn into complete bipartite graphs
• On the decomposition of K_n into complete m‐partite graphs
• On the minimum number of edge‐disjoint complete m‐partite subgraphs into which K_n can be decomposed
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complete multipartite decompositions of complete graphs and complete \(n\)-partite graphs