Please use this identifier to cite or link to this item:
|Title:||Generalization of two results of Hilton on total-colourings of a graph|
|Citation:||Yap, H.P. (1995-06-11). Generalization of two results of Hilton on total-colourings of a graph. Discrete Mathematics 140 (1-3) : 245-252. ScholarBank@NUS Repository.|
|Abstract:||We generalize two results of Hilton on total-colourings of a graph. The first generalized result unifies several previous results/proof techniques of Bermond, Chen, Chew, Fu, Hilton, Wang, and Yap. Applying the second generalized result, we prove that if G ⊆ Kn, n is such that Δ(G) = n - 1 and the complement of G with respect to Kn, n contains a 1-factor, then its total chromatic number is Δ(G) + 1. © 1995.|
|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 Jul 20, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.