Scheduling to reduce close contacts: resolvable grid graph decomposition and packing
- 3 September 2023
- journal article
- research article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 91 (12) , 4093-4106
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Minimum Resolvable Coverings of K v with Copies of K 4 − eGraphs and Combinatorics, 2011
- Resolvable packings ofKvwithK2 × Kc'sJournal of Combinatorial Designs, 2008
- On the existence of resolvable K4 − e designsJournal of Combinatorial Designs, 2007
- A RESOLVABLE $ r\times c$ GRID-BLOCK PACKING AND ITS APPLICATION TO DNA LIBRARY SCREENINGTaiwanese Journal of Mathematics, 2004
- A brief review on Egmont Köhler's mathematical workDiscrete Mathematics, 1991
- A survey of Kirkman triple systems and related designsDiscrete Mathematics, 1991
- Existence of Resolvable Path DesignsEuropean Journal of Combinatorics, 1990
- Frames for Kirkman triple systemsDiscrete Mathematics, 1987
- Resolvable path designsJournal of Combinatorial Theory, Series A, 1985
- Resolvable balanced bipartite designsDiscrete Mathematics, 1976