On the Tractability of (k,i)-Coloring

Sriram Bhyravarapu, Saurabh Joshi, Subrahmanyam Kalyanasundaram +1

In an undirected graph, a proper (k,i)-coloring is an assignment of a set of k colors to each vertex such that any two adjacent vertices have at most i common colors. The (k,i)-col…