1 paper
Jie Ma, Humberto Naves
The number of proper q-colorings of a graph G, denoted by PG(q), is an important graph parameter that plays fundamental role in graph theory, computational complexity theory…