Group Divisible Covering Designs with Block Size 4: A Type of Covering Array with Row Limit
DOI10.1002/jcd.21324zbMath1269.05014OpenAlexW1928034317MaRDI QIDQ2842263
Peter Danziger, Nevena Francetić, Eric Mendelsohn
Publication date: 13 August 2013
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.21324
orthogonal arraysgroup divisible designsgraph covering problemcovering arrays with row limitgroup divisible covering designs
Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Group divisible designs with block size four and group type \(g^um^{1}\) where \(g\) is a multiple of 8
- Minimal coverings of pairs by triples
- On the covering of pairs by quadruples
- Balanced incomplete block designs and related designs
- Group divisible designs with block-size four
- Covering graphs: The covering problem solved
- On group divisible covering designs
- On group-divisible designs with block size four and group-type \(6^{u} m^{1}\).
- HGDDs with block size four.
- Group divisible designs with block size four and group type \(g^{u} m^{1}\) for small \(g\)
- On Steiner systems
- On the covering of pairs by quadruples. I
- On the covering of pairs by quadruples. II
- An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
- Combinatorial Designs
- Incomplete group divisible designs with block size four
This page was built for publication: Group Divisible Covering Designs with Block Size 4: A Type of Covering Array with Row Limit