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)$-coloring problem is to compute the minimum number of colors …
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)$-coloring problem is to compute the minimum number of colors …