Faculté des sciences économiques et sociales

## Graph coloring with cardinality constraints on the neighborhoods

### In: discrete Optimization, 2009, vol. 6, no. 4, p. 362-369

Extensions and variations of the basic problem of graph coloring are introduced. The problem consists essentially in finding in a graph a k-coloring, i.e., a partition (V_1,\cdots,V_k) of the vertex set of G such that, for some specified neighborhood \tilde|{N}(v) of each vertex v, the number of vertices in \tilde|{N}(v)\cap V_i is (at most) a given integer h_i^v. The complexity of some... More