Galois groups of chromatic polynomials

The chromatic polynomial P(G, lambda) gives the number of ways a graph G can be properly coloured in at most lambda colours. This polynomial has been extensively studied in both combinatorics and statistical physics, but there has been little work on its algebraic properties. This paper reports a systematic study of the Galois groups of chromatic polynomials. We give a summary of the Galois groups of all chromatic polynomials of strongly non-clique-separable graphs of order at most 10 and all chromatic polynomials of non-clique-separable lambda-graphs of order at most 19. Most of these chromatic polynomials have symmetric Galois groups. We give five infinite families of graphs: one of these families has chromatic polynomials with a dihedral Galois group and two of these families have chromatic polynomials with cyclic Galois groups. This includes the first known infinite family of graphs that have chromatic polynomials with the cyclic Galois group of order 3.