On chordal graphs and their chromatic polynomials

Authors

  • Geir Agnarsson

DOI:

https://doi.org/10.7146/math.scand.a-14421

Abstract

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.

Downloads

Published

2003-12-01

Issue

Vol. 93 No. 2 (2003)

Section

Articles

How to Cite

[1]
G. Agnarsson, “On chordal graphs and their chromatic polynomials”, Math. Scand., vol. 93, no. 2, pp. 240–246, Dec. 2003, doi: 10.7146/math.scand.a-14421.