Chromatic Factorisations

Abstract

The chromatic polynomial gives the number of proper λ-colourings of a graph G. This paper considers factorisation of the chromatic polynomial as a first step in an algebraic study of the roots of this polynomial. The chromatic polynomial of a graph is said to have a chromatic factorisation if P (G, λ) = P (H1, λ)P (H2, λ)/P (Kr, λ) for some graphs H1 and H2 and clique Kr. It is known that the chromatic polynomial of any clique-separable graph, that is, a graph containing a separating r-clique, has a chromatic factorisation. We show that there exist other chromatic polynomials that have chromatic factorisations but are not the chromatic polynomial of any clique-separable graph and identify all such chromatic polynomials of degree at most 10. We introduce the notion of a certificate of factorisation, which provides an explanation for such a factorisation, and find certificates for all cases of degree ≤ 9. The lengths of these certificates are less than an upper bound we establish of ≤ n22n2/2. Furthermore, we construct an infinite family of non-clique-separable graphs that have chromatic factorisations and give certificates of factorisation for graphs belonging to this family.

14 Figures and Tables

Cite this paper

@inproceedings{Morgan2008ChromaticF, title={Chromatic Factorisations}, author={Kerri Morgan and Graham Farr}, year={2008} }