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

摘要

In this paper we give a complete solution of the simple minimum covering problem for Kv 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 paddings.