Graph Theory Questions
The chromatic polynomial of a graph is a polynomial that counts the number of ways to color the vertices of the graph using a given number of colors, such that no adjacent vertices have the same color. It is denoted by P(G, λ), where G is the graph and λ is the number of colors. The value of the chromatic polynomial at a specific value of λ represents the number of distinct proper vertex colorings of the graph using λ colors.