Please use this identifier to cite or link to this item:
|Title:||The chromatic uniqueness of certain broken wheels|
|Authors:||Koh, K.M. |
|Source:||Koh, K.M.,Teo, C.P. (1991). The chromatic uniqueness of certain broken wheels. Discrete Mathematics 96 (1) : 65-69. ScholarBank@NUS Repository.|
|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  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.|
|Source Title:||Discrete Mathematics|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 8, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.