NP-completeness

On the Tractability of $(k,i)$-Coloring