On the tractability of $(k,i)$-coloring (Extended Journal Version)

Reducing $(k,i)$-coloring to 3-SAT