A note to maximum packings of K-v with a graph G of five vertices and five edges

作者：Milici S^*

来源：Utilitas Mathematica, 2005, 68: 145-153.

• maximum packing
• G-designs

In this paper we give a complete solution of the maximum packing problem for K-v with copies of a graph G having at least one vertex of degree one and such that E(G) = V(G) = 5, for all v >= 7 and for all possible leaves.

• 出版日期2005-11