Please use this identifier to cite or link to this item:
|Title:||Edge colouring of K2n with spanning star-forests receiving distinct colours|
|Authors:||Yap, H.P. |
|Source:||Yap, H.P.,Liu, Q. (1999). Edge colouring of K2n with spanning star-forests receiving distinct colours. Graphs and Combinatorics 15 (2) : 249-255. ScholarBank@NUS Repository.|
|Abstract:||Let Sni be a star of size ni and let S = Sn1 ∪ ⋯ ∪ Snk ≠ S2n-3 ∪ S1 or S2 ∪ S2 be a spanning star-forest of the complete graph K2n. We prove that K2n has a proper (2n - 1)-edge-colouring such that all the edges of S receive distinct colours. This result is very useful in the study of total-colourings of graphs. © Springer-Verlag 1999.|
|Source Title:||Graphs and Combinatorics|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 15, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.