Graph decomposition

This paper surveys some recent results and new techniques concerning edge-disjoint decompositions of Kn into copies of G, where G may be a cycle, a path, or just a small graph. Additional properties of such a decomposition are considered, such as nestings, resolvability, i-perfect, decompositions and self-complementary decompositions. The use of skew Room frames is demonstrated by obtaining some new results when G is small.