A note to maximum packings of K_v with a graph G of five vertices and five edges

MaRDI QIDQ5488362zbMATH OpenFDO

Authors Salvatore Milici

Publication date 14 September 2006

zbMATH Keywords

\(G\)-design\(G\)-decomposition

Mathematics Subject Classification ID

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

Recommendations

• Packing of \(K_{v}\) with certain graphs of five vertices
• Six-vertex graph packings and coverings of \(\lambda K_v\)
• Coverings of a complete graph with five-vertex and five-edge graphs
• scientific article; zbMATH DE number 2114468
• Maximum packings and minimum coverings of \(K_{v}\) with octagons

Cited in

(7)

• Existence of holey LSSOM of type \(2^n\) with application to \(G_7\)-packings of \(K_v\)
• Coverings of a complete graph with five-vertex and five-edge graphs
• A \(5k\)-vertex kernel for \(P_2\)-packing
• Packing of \(K_{v}\) with certain graphs of five vertices
• Constructing the spectrum for packings of the complete graph with trees that have up to five edges
• A catalogue of nonisomorphic 5-homogeneous pentagonal 5-packings
• The optimal drawings of \(K_{5,n}\)

This page was built for publication: A note to maximum packings of \(K_v\) with a graph \(G\) of five vertices and five edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488362)