Resolvable packings ofKvwithK2 × Kc's

DOI10.1002/jcd.20197zbMath1161.05306OpenAlexW1500975782MaRDI QIDQ3619609

Jianxing Yin, Yang Li

Publication date: 8 April 2009

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.20197

zbMATH Keywords

resolvable packingsDNA library screeningCartesian product \(K_r \times K_c\)the complete graph \(K_v\)

Mathematics Subject Classification ID

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

Related Items (4)

The existence of \((K_2\times K_6)\)-designs ⋮ Scheduling to reduce close contacts: resolvable grid graph decomposition and packing ⋮ 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\)

Cites Work

• Unnamed Item
• Unnamed Item
• Pairwise balanced designs with consecutive block sizes
• A survey on maximum distance holey packings
• A resolvable \(r \times c\) grid-block packing and its application to DNA library screening
• Constructions of optimal packing designs
• The Existence of 2×4 Grid-Block Designs and Their Applications
• An isomorphic factorization of the complete graph
• ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS

This page was built for publication: Resolvable packings ofKvwithK₂ × Kc's