A decomposition of a graph G is a set of edge disjoint subgraphs H1, H2, ..., Hr of G such that every edge of G belongs to exactly one Hi. If all the subgraphs in the decomposition of G are isomorphic to a graph H, then ...