Counting equitable $k$-colorings in graphs of bounded clique-width

Holger Dell, Thore Husfeldt, Amir Nikabadi

For a graph $G$, a proper $k$-coloring of $G$ is \emph{equitable} if the sizes of any two color classes differ by at most one. The \textsc{Equitable $k$-Coloring} problem asks, for…