The chromatic polynomial of a graph G, denoted by P(G, k), is a polynomial that counts the number of proper k-colorings of G. A proper k-coloring is an assignment of k colors to the vertices of G such that no two adjacent vertices have the same color.
Step 2:
Show more…