A G-decomposition of a graph H is a set of pairwise edge-disjoint subgraphs of H, each of which is isomorphic to G, such that . We will give an overview of the known results for G-decompositions of the complete graph where G is a graph with six or fewer edges. Then we will completely characterize the graphs G and integers n such that G has six edges and a G-decomposition of exists.