Universal countably chromatic graph

We show that the existence of a universal countably chromatic graph of size ${\mathrm{\aleph }}_1$ together with the failure of continuum hypothesis is consistent. The proof is a forcing iteration of strongly proper ccc posets. The construction works for any uncountable successor cardinal ${\kappa }^{+}$, where $\kappa$ is regular.