On the decomposition of Kn into complete m‐partite graphs
From MaRDI portal
Publication:3970964
DOI10.1002/jgt.3190150102zbMath0758.05082OpenAlexW1764290728WikidataQ126253591 ScholiaQ126253591MaRDI QIDQ3970964
Publication date: 25 June 1992
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190150102
Related Items (5)
Existence on splitting-balanced block designs with resolvability ⋮ Subsets of a finite set that almost always intersect each other in \(\lambda\) elements ⋮ Complete multipartite decompositions of complete graphs and complete \(n\)-partite graphs ⋮ A short proof of Fisher's inequality ⋮ Decompositions of some regular graphs into unicyclic graphs of order five
This page was built for publication: On the decomposition of Kn into complete m‐partite graphs