  A graph $G$ is a $D\!D_2$-graph if it has a pair $(D,D_2)$ of disjoint sets
of vertices of $G$ such that $D$ is a dominating set and $D_2$ is a
2-dominating set of $G$. We provide several characterizations and hardness
results concerning $D\!D_2$-graphs.
