Parameterized Complexity of Equitable Coloring

Guilherme de C. M. Gomes, Carlos V. G. C. Lima, Vinícius F. dos Santos

A graph on $n$ vertices is equitably $k$-colorable if it is $k$-colorable and every color is used either $\lfloor n/k\rfloor$ or $\lceil n/k\rceil$ times. S…