Matching divisible designs with block size four
From MaRDI portal
Publication:898140
Recommendations
Cites work
- scientific article; zbMATH DE number 5130671 (Why is no real title available?)
- scientific article; zbMATH DE number 3487460 (Why is no real title available?)
- scientific article; zbMATH DE number 1471067 (Why is no real title available?)
- 1-factorizing regular graphs of high degree - an improved bound
- Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
- Combinatorial Designs
- Edge-decompositions of graphs with high minimum degree
- Existence of frame SOLS of type a^n b^1
- Existence of holey 3-GDDs of type \((u,g^t w^1)\)
- Graph divisible designs and packing constructions
- Group divisible covering designs with block size 4: A type of covering array with row limit
- Group divisible designs with block size four and group type \(g^um^{1}\) where \(g\) is a multiple of 8
- The existence of HGDDs with block size four and its application to double frames
Cited in
(4)
This page was built for publication: Matching divisible designs with block size four
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898140)