Bounds to the chromatic polynomial of a graph

DOI10.1007/BF03322072zbMath0890.05027OpenAlexW2028417235MaRDI QIDQ1384128

Klaus Dohmen

Publication date: 22 June 1998

Published in: Results in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03322072

zbMATH Keywords

colouringgirthchromatic polynomialBonferroni inequality

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

The maximum number of colorings of graphs of given order and size: a survey ⋮ Maximum number of colourings: 4-chromatic graphs

Cites Work

• A contribution to the chromatic theory of uniform hypergraphs
• Lower bounds and upper bounds for chromatic polynomials

This page was built for publication: Bounds to the chromatic polynomial of a graph