$\begingroup$

Hints: If $G$ is the given $k$-degenerate graph, notice that $G$ is an induced subgraph of itself and so $G$ has a vertex $v$ of degree at most $k$.

Why is $G-v$ also $k$-degenerate?

Now apply induction on the number of vertices to colour $G- v$ with $k+1$ colours.