Nemotron-IMO-Bench 2026 C43

A graph $G$ on $n$ vertices is not complete, has no isolated vertex (i.e. of degree $0$) and each dominating set has size $\geq k\geq 1$. Prove that the chromatic number of $G$ is $\leq n-k$.