The chromaticity of wheels (Q798668): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 01:15, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The chromaticity of wheels |
scientific article |
Statements
The chromaticity of wheels (English)
0 references
1984
0 references
A graph G is said to be chromatically unique, if \(P(H,\lambda)=P(G,\lambda)\) implies that H is isomorphic to G, where P(G,\(\lambda)\) denotes the chromatic polynomial of G. In this paper it is proved that the wheel \(W_{n+1}\) is chromatically unique if n is even but \(W_ 8\) is not chromatically unique. Since \(W_ 6\) is also not chromatically unique the following conjecture is made: The wheel \(W_{n+1}\) is not chromatically unique for odd \(n\geq 9\).
0 references
wheel
0 references
chromatically unique graphs
0 references
chromatic polynomial
0 references