Please use this identifier to cite or link to this item:
|Title:||Divisibility of certain coefficients of the chromatic polynomials|
Fundamental reduction formula
Uniquely k-colourable graph
|Source:||Dong, F.M., Koh, K.M., Soh, C.A. (2004-01-28). Divisibility of certain coefficients of the chromatic polynomials. Discrete Mathematics 275 (1-3) : 311-317. ScholarBank@NUS Repository. https://doi.org/10.1016/j.disc.2003.05.007|
|Abstract:||The divisibility of certain coefficient of the chromatic polynomials was discussed. It is found that G was considered as a graph with vertex set V(G) and edge set, and of order n (=|V(G)|)and size m (=|E(G)|). The number of spanning subgraphs of G that had exactly n - i edges and that contained no broken cycles was counted. Results shows that when G was uniquely k-colorable graph, where k≥2, then a1(G) was divisible by (k - 1)!.|
|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 Feb 15, 2018
WEB OF SCIENCETM
checked on Jan 30, 2018
checked on Feb 19, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.