Publication

The chromatic uniqueness of certain broken wheels

Citations
Altmetric:
Alternative Title
Abstract
Let W(n,k) denote the graph of order n obtained from a wheel Wn by deleting all but k consecutive spokes. It is known that W(n,1) (n≥4) and W(n,2) (n≥4) are χ-unique. Chao and Whitehead [1] showed that W(n,3) (n≥5) and W(n,4) (n≥6)are also χ-unique but pointed out that W(7,5) is not so. In this note, we prove that W(n,5) is χ-unique for n≥8. © 1991.
Keywords
Source Title
Discrete Mathematics
Publisher
Series/Report No.
Organizational Units
Organizational Unit
DECISION SCIENCES
dept
Organizational Unit
MATHEMATICS
dept
Rights
Date
1991
DOI
Type
Article
Additional Links
Related Datasets
Related Publications