论文部分内容阅读
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 computational complexity and other fields.