Pages that link to "Item:Q4285594"
From MaRDI portal
The following pages link to On the minimum number of edge‐disjoint complete <i>m</i>‐partite subgraphs into which <i>K<sub>n</sub></i> can be decomposed (Q4285594):
Displaying 3 items.
- Complete multipartite decompositions of complete graphs and complete \(n\)-partite graphs (Q1430968) (← links)
- Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs (Q3720624) (← links)
- On the decomposition of <i>K</i><sub><i>n</i></sub> into complete <i>m</i>‐partite graphs (Q3970964) (← links)