A Survey of Resolvable Solutions of Balanced Incomplete Block Designs
From MaRDI portal
Cited in
(24)- On Kirkman triple systems of order 33
- Some imbedding theorems for block designs balanced with respect to pairs
- The existence of some resolvable block designs with divisibility into groups
- A recursive method of construction of resolvable BIB-designs
- Construction of nested balanced block designs, rectangular designs and \(q\)-ary codes
- Construction of group divisible designs and rectangular designs from resolvable and almost resolvable balanced incomplete block designs
- The 1-rotational Kirkman triple systems of order 33
- The family of block designs with some combinatorial properties
- Recursive constructions for cyclic BIB designs and their generalizations
- The family of t-designs. II
- On mu-resolvable BIB designs
- A complete classification of (12, 4, 3)-RBIBDs
- An extension method for balanced arrays
- On Generation of Efficient Partial Diallel Crosses Plans
- Robustness of designed experiments against missing data
- Quasi-symmetric designs with \(k\) numbers of intersection as unreduced designs
- On the resolutions of cyclic Steiner triple systems with small parameters
- On Combining Information in Generally Balanced Nested Block Designs
- Rectangular Hadamard matrices
- A construction of group divisible designs
- A survey of resolvable solutions of partially balanced designs
- A survey on partially resolvable solutions of regular group divisible designs
- Existence of certain block designs
- Note on the construction of optimum chemical balance weighing designs
This page was built for publication: A Survey of Resolvable Solutions of Balanced Incomplete Block Designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5663879)
