Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/45069
DC Field | Value | |
---|---|---|
dc.title | Edge colouring of K2n with spanning star-forests receiving distinct colours | |
dc.contributor.author | Yap, H.P. | |
dc.contributor.author | Liu, Q. | |
dc.date.accessioned | 2013-10-10T05:02:38Z | |
dc.date.available | 2013-10-10T05:02:38Z | |
dc.date.issued | 1999 | |
dc.identifier.citation | 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. | |
dc.identifier.issn | 09110119 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/45069 | |
dc.description.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. | |
dc.source | Scopus | |
dc.type | Article | |
dc.contributor.department | DECISION SCIENCES | |
dc.contributor.department | MATHEMATICS | |
dc.description.sourcetitle | Graphs and Combinatorics | |
dc.description.volume | 15 | |
dc.description.issue | 2 | |
dc.description.page | 249-255 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.