  The design spectrum of a simple graph $G$ is the set of positive integers $n$
such that there exists an edgewise decomposition of the complete graph $K_n$
into $n(n - 1)/(2 |E(G)|)$ copies of $G$. We compute the design spectra for
7788 6-regular graphs with 12 vertices.
