Extremal properties of the chromatic polynomials of connected 3-chromatic graphs (Q2914003)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6085321
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extremal properties of the chromatic polynomials of connected 3-chromatic graphs |
scientific article; zbMATH DE number 6085321 |
Statements
21 September 2012
0 references
chromatic polynomial
0 references
3-color partition
0 references
skeleton of a graph
0 references
greatest values
0 references
0.9490866
0 references
0.9232203
0 references
0.9124507
0 references
0.90886676
0 references
0 references
0.9027399
0 references
0.90074116
0 references
0.8996103
0 references
Extremal properties of the chromatic polynomials of connected 3-chromatic graphs (English)
0 references
Let \(P(G;\lambda)\) denote the chromatic polynomial of a graph \(G\). The greatest \(\left\lfloor\frac n2\right\rfloor\) values of \(P(G;3)\) in the class of connected 3-chromatic graphs \(G\) of order \(n\) are found.
0 references
