For any graph with n vertices, the number of proper colorings (colorings where no two colors are adjacent) using at most \(k\) colors is an \(n\)th-degree polynomial with variable \(k\) called the chromatic polynomial of \(G\).