×

zbMATH — the first resource for mathematics

The chromaticity of odd wheels with a missing spoke. (English) Zbl 0880.05038
A graph \(G\) is said to be \(\chi\)-unique if no graph not isomorphic with \(G\) has the same chromatic polynomial as \(G\). K. M. Koh and K. L. Teo [Graphs Comb. 6, No. 3, 259-285 (1990; Zbl 0727.05023)] asked if every wheel of odd order at least nine with a missing spoke is \(\chi\)-unique. The present paper answers this question in the affirmative.

MSC:
05C15 Coloring of graphs and hypergraphs
PDF BibTeX XML Cite