Citation
Lau, G. C. and Peng, Y. H.
(2008)
On the chromaticity of complete multipartite graphs with certain edges added.
Discrete Mathematics, 309 (12).
pp. 4089-4094.
ISSN 0012-365X
Abstract
Let P.G; / be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any graph H, P.H; / D P.G; / implies H is isomorphic to G. For integers k 0, t 2,denote by K..t
Download File
Official URL or Download Paper: http://dx.doi.org/10.1016/j.disc.2008.12.008
|
Additional Metadata
| Item Type: | Article |
|---|---|
| Divisions: | Faculty of Science |
| DOI Number: | https://doi.org/10.1016/j.disc.2008.12.008 |
| Publisher: | Elsevier |
| Keywords: | Multipartite graph, Chromatic polynomial, Chromatic equivalence and uniqueness |
| Depositing User: | Najwani Amir Sariffudin |
| Date Deposited: | 01 Jun 2010 03:54 |
| Last Modified: | 05 Oct 2015 08:19 |
| Altmetrics: | http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1016/j.disc.2008.12.008 |
| URI: | http://psasir.upm.edu.my/id/eprint/7016 |
| Statistic Details: | View Download Statistic |
Actions (login required)
 |
View Item |