An graph is a multigraph on three vertices with a double edge between one pair of distinct vertices and a single edge between the other two pairs. The problem of decomposing a complete multigraph into graphs has been completely solved. In this paper, we describe some new procedures for such decompositions and pose the following question: Can these procedures be adapted or extended to provide a unified proof of the existence of ’s?