--
Selma Djelloul
(LISN, Galac)
summary: Given positive integers k, q, we say that a graph is edge k-q-colorable if its edges can be colored
in such a way that the number of colors incident to each vertex is at most q and that the size of
a largest color class is at most k ...
