  In this paper, we characterize the sets $\mathcal{H}$ of connected graphs
such that there exists a constant $c=c(\mathcal{H})$ satisfying $\gamma (G)\leq
c$ for every connected $\mathcal{H}$-free graph $G$, where $\gamma (G)$ is the
domination number of $G$.
