Upper bounds on the average number of colors in the non-equivalent colorings of a graph

Alain Hertz, Hadrien Mélot, Sébastien Bonte +2

A coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. Two colorings are equivalent if they induce the same partition o…