On chordal graphs and their chromatic polynomials

DOI10.7146/math.scand.a-14421zbMath1076.05509OpenAlexW141715955MaRDI QIDQ4459341

Geir Agnarsson

Publication date: 28 March 2004

Published in: MATHEMATICA SCANDINAVICA (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7146/math.scand.a-14421

zbMATH Keywords

cliquechromatic polynomialpower of a graphChordal graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Counting and sampling orientations on chordal graphs ⋮ Root multiplicities for Borcherds algebras and graph coloring ⋮ On the chromatic polynomial and counting DP-colorings of graphs ⋮ Exposed circuits, linear quotients, and chordal clutters

This page was built for publication: On chordal graphs and their chromatic polynomials