  We prove that the vertices of every $(r + 1)$-uniform hypergraph with maximum
degree $\Delta$ may be coloured with $c(\frac{\Delta}{d + 1})^{1/r}$ colours
such that each vertex is in at most $d$ monochromatic edges. This result, which
is best possible up to the value of the constant $c$, generalises the classical
result of Erd\H{o}s and Lov\'asz who proved the $d = 0$ case.
