A note on the chromatic uniqueness of \(W_ 10\)
type: Item
instance of: scholarly article
title: A note on the chromatic uniqueness of \(W_ 10\)
zbMATH Open document ID: 0639.05019
DOI: 10.1016/0012-365X(88)90061-1
published in: Discrete Mathematics
publication date: 1988-01-01T00:00:00Z
review text: Graph G is chromatically unique if it is the only graph with its chromatic polynomial. \textit{X. Xu} and \textit{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.
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 4041941
zbMATH Keywords: chromatically unique graphs
zbMATH Keywords: chromatic polynomial
zbMATH Keywords: wheels
author: Ronald C. Read
reviewed by: John Mitchem
MaRDI profile type: Publication
cites work: Cataloguing the graphs on 10 vertices
cites work: The chromaticity of wheels
Recommended article: The chromatic uniqueness of \(W_{10}\)
Recommended article: A note on uniquely 10‐colorable graphs
Recommended article: On the chromatic uniqueness of the graph \(W(n,n-2,k)\)
Recommended article: Q3775576
Recommended article: A note on chromatic uniqueness of graphs
Recommended article: On the chromatic uniqueness of the graph \(W(n,n-2)+K_ k\)
Recommended article: Q3824333
Recommended article: Q4031916
Recommended article: Q4327762
Recommended article: Q5202203
description: scientific article; zbMATH DE number 4041941