On the existence of maximum resolvable (\(K_{4} - e\))-packings
From MaRDI portal
Publication:965971
DOI10.1016/j.disc.2009.10.007zbMath1236.05060OpenAlexW2050954704MaRDI QIDQ965971
Publication date: 27 April 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.10.007
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40)
Related Items
On the existence of resolvable \((K_{3} + e)\)-group divisible designs ⋮ Minimum resolvable coverings of \(K_{v}\) with copies of \(K_{4}-e\) ⋮ Completing the spectrum for three designs related to the graph \(K_4 - e\)
Cites Work
- Packing of \(K_{v}\) with certain graphs of five vertices
- The packing and covering of the complete graph. I: The forests of order five
- \(G\)-decomposition of \(K_n\), where G has four vertices or less
- Optimal packings of \(K_4\)'s into a \(K_n\)
- Maximum packings of \(K_ n\) with copies of \(K_ 4-e\)
- Resolvable maximum packings with quadruples
- Asymptotic results on the existence of 4‐RGDDs and uniform 5‐GDDs
- On the existence of resolvable K4 − e designs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item