On chordal graphs and their chromatic polynomials

Geir Agnarsson


We derive a formula for the chromatic polynomial of a chordal or a triangulated graph in terms of its maximal cliques. As a corollary we obtain a way to write down an explicit formula for the chromatic polynomial for an arbitrary power of a graph which belongs to any given class of chordal graphs that are closed under taking powers.

Full Text:


DOI: http://dx.doi.org/10.7146/math.scand.a-14421


  • There are currently no refbacks.
This website uses cookies to allow us to see how the site is used. The cookies cannot identify you or any content at your own computer.

ISSN 0025-5521 (print) ISSN 1903-1807 (online)

Hosted by the Royal Danish Library