The following pages link to (Q3526001):
Displaying 41 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)
- Pairwise balanced design of order \(6n+4\) and 2-fold system of order \(3n+2\) (Q1935973) (← links)
- Decompositions of some classes of dense graphs into cycles of lengths 4 and 8 (Q2042208) (← links)
- Decomposition of complete equipartite graphs into paths and cycles of length \(2p\) (Q2092386) (← links)
- Decompositions of line graphs of complete graphs into paths and cycles (Q2092392) (← links)
- Embedding partial Latin squares in Latin squares with many mutually orthogonal mates (Q2174579) (← links)
- Zero-sum flows for Steiner systems (Q2198394) (← links)
- PBIB-designs and association schemes arising from minimum bi-connected dominating sets of hypercubes (Q2211809) (← links)
- Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6 (Q2214321) (← links)
- New partitionings of complete designs (Q2243891) (← links)
- Gregarious kite factorization of tensor product of complete graphs (Q2282461) (← links)
- A \(C_5\)-decomposition of the \(\lambda\)-fold line graph of the complete graph (Q2312810) (← links)
- \(C_{4p}\)-frame of complete multipartite multigraphs (Q2375912) (← links)
- Internally fair factorizations and internally fair holey factorizations with prescribed regularity (Q2401437) (← links)
- A polynomial embedding of pairs of orthogonal partial Latin squares (Q2452422) (← links)
- Enclosings of \(\lambda\)-fold 5-cycle systems for \(u = 2\) (Q2514160) (← links)
- The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles (Q2637730) (← links)
- On Decomposing the Complete Graph into the Union of Two Disjoint Cycles (Q2946050) (← links)
- Group divisible designs with block size five from Clatworthy's table (Q4563521) (← links)
- Multidecompositions of line graphs of complete graphs (Q4968283) (← links)
- (Q4990119) (← links)
- Determination of the size of defining set for Steiner triple systems (Q5059557) (← links)
- (Q5109056) (← links)
- The 3-way flower intersection problem for Steiner triple systems (Q5130736) (← links)
- (Q5139702) (← links)
- Decomposition of complete tripartite graphs into cycles and paths of length three (Q5149422) (← links)
- Decompositions of some regular graphs into unicyclic graphs of order five (Q5197547) (← links)
- (Q5241129) (← links)
- (Q5377016) (← links)
- (Q5377023) (← links)
- Two unfortunate properties of pure $f$-vectors (Q5496432) (← links)
- A note on $GDD(1, n, n , 4;\lambda_{1},\lambda_{2})$ (Q5884137) (← links)
- Decomposition of product graphs into paths and cycles of length four (Q5964986) (← links)
- Clique immersion in graph products (Q6041549) (← links)
- Partially balanced incomplete block (PBIB)-designs arising from diametral paths in some strongly regular graphs (Q6059084) (← links)
- Cycles of quadratic Latin squares and antiperfect 1‐factorisations (Q6064437) (← links)
- Primitive cycle decompositions of Kn and Kn−I (Q6146186) (← links)
