The Existence of 2×4 Grid-Block Designs and Their Applications

DOI10.1137/S0895480101387364zbMath1029.05013OpenAlexW2010431671MaRDI QIDQ4443078

Toshio Morihara, Masakazu Jimbo, Yukiyasu Mutoh, Hung-Lin Fu

Publication date: 8 January 2004

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480101387364

zbMATH Keywords

graph designgraph decompositiongrid-block

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

The existence of \((K_2\times K_6)\)-designs ⋮ Grid-block difference families and related combinatorial structures ⋮ The existence of \((2 \times c, \lambda )\) grid-block designs with \({c\in \{3, 4, 5\}}\) and \(\lambda \geq 1\) ⋮ Decomposing complete graphs into \(K_{r} \times K_{c}\)'s. ⋮ The decomposition of \(K_v\) into \(K_2\times K_5\)'s ⋮ Maximum cyclic 4-cycle packings of the complete multipartite graph ⋮ Resolvable packings ofKvwithK₂ × Kc's

This page was built for publication: The Existence of 2×4 Grid-Block Designs and Their Applications