Graphs and the multiplicity of root 2 in chromatic polynomials (Q2721569)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graphs and the multiplicity of root 2 in chromatic polynomials |
scientific article; zbMATH DE number 1613192
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs and the multiplicity of root 2 in chromatic polynomials |
scientific article; zbMATH DE number 1613192 |
Statements
9 October 2002
0 references
block
0 references
non-bipartite graphs
0 references
0.9312606
0 references
0.92716587
0 references
0 references
0.9198433
0 references
0.9177699
0 references
0.91748035
0 references
0 references
Graphs and the multiplicity of root 2 in chromatic polynomials (English)
0 references
A connected graph without a cut vertex is called a block. The author shows that the multiplicity of the root 2 in the chromatic polynomial of a 3-connected non-bipartite graph is 1. She also shows that for a certain family of non-bipartite graphs with connectivity not equal to 3, the multiplicity of the root 2 in their chromatic polynomial is equal to the number of non-bipartite blocks and non-bipartite separable blocks.
0 references
