Maximizing proper colorings on graphs

Jie Ma, Humberto Naves

The number of proper $q$-colorings of a graph $G$, denoted by $P_G(q)$, is an important graph parameter that plays fundamental role in graph theory, computational complexity theory…