Degree-Doubling Graph Families

Let ${\cal G}$ be a family of $n$-vertex graphs of uniform degree 2 with the property that the union of any two member graphs has maximum degree 4. We determine the leading term in the asymptotics of the largest cardinality of such a family. Several analogous problems are discussed.