New! You can now keep track of new articles from Proceedings of the London Mathematical Society on your personalized homepage!
Let P G ( q ) denote the number of proper q -colorings of a graph G . This function, called the chromatic polynomial of G , was introduced by Birkhoff in 1912, who sought to attack the famous four-color problem by minimizing P G (4) over all planar graphs G . Since then, motivated by a variety of...