zbMATH — the first resource for mathematics

A note on the chromatic uniqueness of \(W_ 10\). (English) Zbl 0639.05019
Graph G is chromatically unique if it is the only graph with its chromatic polynomial. X. Xu and N. Li [Discrete Math. 51, 207-212 (1984; Zbl 0547.05032)] showed that wheels of odd order are chromatically unique and conjectured that wheels of even order are not, after showing that \(W_ 8\) is not chromatically unique. The author used a computer search to show that \(W_{10}\) is chromatically unique.
Reviewer: J.Mitchem

05C15 Coloring of graphs and hypergraphs
Full Text: DOI
[1] Cameron, R.E.; Colbourn, C.J.; Read, R.C.; Wormald, N.C., Cataloguing the graphs on 10 vertices, J. graph theory, 9, 551-562, (1985) · Zbl 0664.05055
[2] Xu, S.; Li, N., The chromaticity of wheels, Discrete math., 51, 207-212, (1984) · Zbl 0547.05032
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.