Coverings of a complete graph with five-vertex and five-edge graphs

DOI10.1016/j.disc.2003.11.035zbMath1044.05022OpenAlexW2030335621MaRDI QIDQ1876694

Salvatore Milici

Publication date: 20 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.035

zbMATH Keywords

Minimum covering\(G\)-designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of packing and covering (05B40)

Related Items (1)

Constructions of optimal packing and covering of the complete multigraph with applications

Cites Work

• Packing of \(K_{v}\) with certain graphs of five vertices
• Minimal coverings of pairs by triples
• Packing and covering of the complete graph with a graph G of four vertices or less
• \(G\)-decomposition of \(K_n\), where G has four vertices or less
• On the covering of pairs by quadruples. I
• On the covering of pairs by quadruples. II
• Simple minimum coverings of \(K_n\) with copies of \(K_4 -e\)
• Packing and Covering of the Complete Graph with 4-Cycles^*
• Existence of holey LSSOM of type \(2^n\) with application to \(G_7\)-packings of \(K_v\)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Coverings of a complete graph with five-vertex and five-edge graphs