The number of proper q-colorings of a graph G,i.e.,the chromatic polynomial PG(q),plays a fundamental role in graph theory and is also important to computat
A coloring of a graph G =(V,E)is a partition {V1,V2,…,Vk} of V into independent sets or color classes.A vertex v∈Vi is a Grundy vertex if it is adjacent t