TY - JOUR AU - Agnarsson, Geir PY - 2003/12/01 Y2 - 2024/03/29 TI - On chordal graphs and their chromatic polynomials JF - MATHEMATICA SCANDINAVICA JA - Math. Scand. VL - 93 IS - 2 SE - Articles DO - 10.7146/math.scand.a-14421 UR - https://www.mscand.dk/article/view/14421 SP - 240-246 AB - 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. ER -