Scheduling to reduce close contacts: resolvable grid graph decomposition and packing

DOI10.1007/s10623-023-01291-9zbMath1530.92214OpenAlexW4386399820MaRDI QIDQ6070358

Yeow Meng Chee, Hui Zhang, Alan C. H. Ling, Van Khu Vu

Publication date: 20 November 2023

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-023-01291-9

zbMATH Keywords

decompositionpackingframeaffine planeresolvablegrid graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum resolvable coverings of \(K_{v}\) with copies of \(K_{4}-e\)
• Existence of resolvable path designs
• Resolvable path designs
• Frames for Kirkman triple systems
• A survey of Kirkman triple systems and related designs
• A brief review on Egmont Köhler's mathematical work
• Resolvable balanced bipartite designs
• A resolvable \(r \times c\) grid-block packing and its application to DNA library screening
• Grid-block difference families and related combinatorial structures
• Resolvable packings ofKvwithK₂ × Kc's
• On the existence of resolvable K₄ − e designs

This page was built for publication: Scheduling to reduce close contacts: resolvable grid graph decomposition and packing