The following pages link to (Q3526001):
Displaying 6 items.
- Generalized packing designs (Q385379) (← links)
- A natural generalization of orthogonality of Latin squares (Q456900) (← links)
- Twofold triple systems without 2-intersecting Gray codes (Q521863) (← links)
- Almost resolvable maximum packings of complete graphs with 4-cycles (Q659680) (← links)
- Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph \(G\) where \(G\) is the union of two disjoint cycles (Q1678094) (← links)
- Decomposition of product graphs into paths and cycles of length four (Q5964986) (← links)
