1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/131441
DC FieldValue
dc.titleOn the chromatic uniqueness of the graph W(n, n - 2, k)
dc.contributor.authorDong, F.M.
dc.contributor.authorLiu, Y.P.
dc.date.accessioned2016-11-28T10:20:17Z
dc.date.available2016-11-28T10:20:17Z
dc.date.issued1996
dc.identifier.citationDong, F.M., Liu, Y.P. (1996). On the chromatic uniqueness of the graph W(n, n - 2, k). Graphs and Combinatorics 12 (1) : 221-230. ScholarBank@NUS Repository.
dc.identifier.issn09110119
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/131441
dc.description.abstractThis paper shows that the graph W(n, n - 2, k) is chromatically unique for any even integer n ≥ 6 and any integer k ≥ 1. © Springer-Verlag 1996.
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentINFORMATION SYSTEMS & COMPUTER SCIENCE
dc.description.sourcetitleGraphs and Combinatorics
dc.description.volume12
dc.description.issue1
dc.description.page221-230
dc.identifier.isiutNOT_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.