Minimum resolvable coverings of K_v with copies of K₄-e
From MaRDI portal
Publication:659751
Recommendations
Cites work
- scientific article; zbMATH DE number 4006279 (Why is no real title available?)
- scientific article; zbMATH DE number 4059426 (Why is no real title available?)
- scientific article; zbMATH DE number 3485815 (Why is no real title available?)
- scientific article; zbMATH DE number 3563140 (Why is no real title available?)
- scientific article; zbMATH DE number 3590280 (Why is no real title available?)
- scientific article; zbMATH DE number 637332 (Why is no real title available?)
- scientific article; zbMATH DE number 1011065 (Why is no real title available?)
- scientific article; zbMATH DE number 917328 (Why is no real title available?)
- scientific article; zbMATH DE number 3392464 (Why is no real title available?)
- On the existence of maximum resolvable (\(K_{4} - e\))-packings
- On the existence of resolvable K4 − e designs
- Pair covering designs with block size 5
- Resolvable maximum packings with quadruples
- Resolvable minimum coverings with quadruples
- Simple minimum coverings of \(K_n\) with copies of \(K_4 -e\)
- Some more 5-GDDs and optimal (v), 5, 1)-packings
- \(G\)-decomposition of \(K_n\), where G has four vertices or less
Cited in
(8)- Equitable resolvable coverings
- Minimum resolvable coverings with small parallel classes
- 4-cycle coverings of the complete graph with a hole
- scientific article; zbMATH DE number 1394635 (Why is no real title available?)
- On the existence of maximum resolvable (\(K_{4} - e\))-packings
- Scheduling to reduce close contacts: resolvable grid graph decomposition and packing
- Completing the spectrum for three designs related to the graph K₄ - e
- Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs
This page was built for publication: Minimum resolvable coverings of \(K_{v}\) with copies of \(K_{4}-e\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659751)