Chromatic polynomial

Function in algebraic graph theory / From Wikipedia, the free encyclopedia

Dear Wikiwand AI, let's keep it short by simply answering these key questions:

Can you list the top facts and stats about Chromatic polynomial?

Summarize this article for a 10 year old

SHOW ALL QUESTIONS

The chromatic polynomial is a graph polynomial studied in algebraic graph theory, a branch of mathematics. It counts the number of graph colorings as a function of the number of colors and was originally defined by George David Birkhoff to study the four color problem. It was generalised to the Tutte polynomial by Hassler Whitney and W. T. Tutte, linking it to the Potts model of statistical physics.

Chromatic_polynomial_of_all_3-vertex_graphs_BW.png
All non-isomorphic graphs on 3 vertices and their chromatic polynomials, clockwise from the top. The independent 3-set: k3. An edge and a single vertex: k2(k – 1). The 3-path: k(k – 1)2. The 3-clique: k(k – 1)(k – 2).

Oops something went wrong: