The following pages link to (Q4374707):
Displaying 8 items.
- Decompositions of complete multigraphs related to Hadamard matrices (Q1268621) (← links)
- Decompositions of complete multigraphs derived from Hadamard matrices (Q1399905) (← links)
- Complete multipartite decompositions of complete graphs and complete \(n\)-partite graphs (Q1430968) (← links)
- Clique decompositions of multipartite graphs and completion of Latin squares (Q2363362) (← links)
- Existence on splitting-balanced block designs with resolvability (Q2364419) (← links)
- On the decomposition of <i>K</i><sub><i>n</i></sub> into complete <i>m</i>‐partite graphs (Q3970964) (← links)
- 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) (← links)
- Sharp bounds for decompositions of graphs into completer-partite subgraphs (Q4879175) (← links)