The existence of \((K_2\times K_6)\)-designs
From MaRDI portal
Publication:367091
DOI10.1007/s00373-012-1187-6zbMath1272.05017OpenAlexW2335867111MaRDI QIDQ367091
Charles J. Colbourn, Cheng Min Wang
Publication date: 26 September 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1187-6
group divisible designbalanced incomplete block designpairwise balanced designgraph designgrid design
Related Items
Improving the existence bounds for grid-block difference families, Grid-block difference families and related combinatorial structures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pooling, lattice square, and union jack designs
- Decomposing complete graphs into \(K_{r} \times K_{c}\)'s.
- A resolvable \(r \times c\) grid-block packing and its application to DNA library screening
- The decomposition of \(K_v\) into \(K_2\times K_5\)'s
- The Existence of $r\times4$ Grid-Block Designs with $r=3,4$
- Resolvable packings ofKvwithK2 × Kc's
- The Existence of 2×4 Grid-Block Designs and Their Applications
- An isomorphic factorization of the complete graph