Minimum resolvable coverings of \(K_{v}\) with copies of \(K_{4}-e\)

DOI10.1007/S00373-010-1003-0zbMath1233.05046OpenAlexW2786935867MaRDI QIDQ659751

Renwang Su, Li-Dong Wang

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-1003-0

zbMATH Keywords

Minimum\((K_{4}-e)\)-coverings\((K_{4}-e)\)-packingsResolvable

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Scheduling to reduce close contacts: resolvable grid graph decomposition and packing ⋮ Completing the spectrum for three designs related to the graph \(K_4 - e\)

Cites Work

• Pair covering designs with block size 5
• On the existence of maximum resolvable (\(K_{4} - e\))-packings
• \(G\)-decomposition of \(K_n\), where G has four vertices or less
• Resolvable maximum packings with quadruples
• Simple minimum coverings of \(K_n\) with copies of \(K_4 -e\)
• Resolvable minimum coverings with quadruples
• Some more 5-GDDs and optimal (v), 5, 1)-packings
• On the existence of resolvable K₄ − e designs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum resolvable coverings of \(K_{v}\) with copies of \(K_{4}-e\)