On the minimum number of edge‐disjoint complete m‐partite subgraphs into which Kn can be decomposed

DOI10.1002/JGT.3190170609zbMath0796.05077OpenAlexW2063777608MaRDI QIDQ4285594

Qingxue Huang

Publication date: 15 September 1994

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190170609

zbMATH Keywords

decompositioncomplete graphsubgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

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

This page was built for publication: On the minimum number of edge‐disjoint complete m‐partite subgraphs into which K_n can be decomposed