Bounds to the chromatic polynomial of a graph (Q1384128): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Klaus Dohmen / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Ioan Tomescu / rank | |||
Normal rank | |||
Revision as of 12:05, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds to the chromatic polynomial of a graph |
scientific article |
Statements
Bounds to the chromatic polynomial of a graph (English)
0 references
22 June 1998
0 references
An inductive proof by induction on the number of edges of some recently published Bonferroni-type bounds to the chromatic polynomial of a graph [\textit{K. Dohmen}, Result. Math. 28, No. 1, 49-52 (1995; Zbl 0831.05029)] is presented.
0 references
chromatic polynomial
0 references
girth
0 references
Bonferroni inequality
0 references
colouring
0 references
