Group divisible packings and coverings with any minimum leave and minimum excess
From MaRDI portal
Publication:2631085
Recommendations
Cites work
- \(G\)-decomposition of \(K_n\), where G has four vertices or less
- A class of partial triple systems with applications in survey sampling
- Balanced incomplete block designs and related designs
- Combinatorial Designs
- Existence of Five MOLS of Orders 18 and 60
- Existence of holey 3-GDDs of type \((u,g^t w^1)\)
- Group divisible covering designs with block size 4: A type of covering array with row limit
- scientific article; zbMATH DE number 4150168 (Why is no real title available?)
- scientific article; zbMATH DE number 3788645 (Why is no real title available?)
- scientific article; zbMATH DE number 54794 (Why is no real title available?)
- scientific article; zbMATH DE number 3487460 (Why is no real title available?)
- scientific article; zbMATH DE number 1229600 (Why is no real title available?)
- scientific article; zbMATH DE number 1355275 (Why is no real title available?)
- scientific article; zbMATH DE number 1051276 (Why is no real title available?)
- scientific article; zbMATH DE number 3417473 (Why is no real title available?)
- Incomplete group divisible designs with block size four
- Kite-group divisible designs of type \(g^{ t } u^{1}\)
- Matching divisible designs with block size four
- Maximal consistent families of triples
- Maximum packings of uniform group divisible triple systems
- MGDD with block size 4 and its application to sampling designs
- Minimal coverings of pairs by triples
- On group divisible covering designs
- Optimal packings of \(K_4\)'s into a \(K_n\)
- Packing designs with equal-sized holes
- Some recent developments on BIBDs and related designs
- TBSs in some minimum coverings
- Tight blocking sets in some maximum packings of K_n
Cited in
(7)- Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs
- scientific article; zbMATH DE number 125479 (Why is no real title available?)
- Maximum packings of uniform group divisible triple systems
- Maximum packing and minimum covering of the line graph of the complete graph with kite
- Packings and coverings of lambda-fold line graphs of the complete graph with \(k\)-cycles, for \(k=4,6\)
- Kite-group divisible packings and coverings with any minimum leave and minimum excess
- Group divisible (K₄-e)-packings with any minimum leave
This page was built for publication: Group divisible packings and coverings with any minimum leave and minimum excess
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631085)