On the chromaticity of complete multipartite graphs with certain edges added
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
محفوظ في:
المؤلفون الرئيسيون: | , |
---|---|
التنسيق: | مقال |
اللغة: | English English |
منشور في: |
Elsevier
2008
|
الوصول للمادة أونلاين: | http://psasir.upm.edu.my/id/eprint/7016/1/On%20the%20chromaticity%20of%20complete%20multipartite%20graphs%20with%20certain%20edges%20added.pdf http://psasir.upm.edu.my/id/eprint/7016/ http://dx.doi.org/10.1016/j.disc.2008.12.008 |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
id |
my.upm.eprints.7016 |
---|---|
record_format |
eprints |
spelling |
my.upm.eprints.70162015-10-05T08:19:36Z http://psasir.upm.edu.my/id/eprint/7016/ On the chromaticity of complete multipartite graphs with certain edges added Lau, G. C. Peng, Y. H. 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 Elsevier 2008 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/7016/1/On%20the%20chromaticity%20of%20complete%20multipartite%20graphs%20with%20certain%20edges%20added.pdf 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 http://dx.doi.org/10.1016/j.disc.2008.12.008 10.1016/j.disc.2008.12.008 English |
institution |
Universiti Putra Malaysia |
building |
UPM Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Putra Malaysia |
content_source |
UPM Institutional Repository |
url_provider |
http://psasir.upm.edu.my/ |
language |
English English |
description |
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 |
format |
Article |
author |
Lau, G. C. Peng, Y. H. |
spellingShingle |
Lau, G. C. Peng, Y. H. On the chromaticity of complete multipartite graphs with certain edges added |
author_facet |
Lau, G. C. Peng, Y. H. |
author_sort |
Lau, G. C. |
title |
On the chromaticity of complete multipartite graphs with certain edges added |
title_short |
On the chromaticity of complete multipartite graphs with certain edges added |
title_full |
On the chromaticity of complete multipartite graphs with certain edges added |
title_fullStr |
On the chromaticity of complete multipartite graphs with certain edges added |
title_full_unstemmed |
On the chromaticity of complete multipartite graphs with certain edges added |
title_sort |
on the chromaticity of complete multipartite graphs with certain edges added |
publisher |
Elsevier |
publishDate |
2008 |
url |
http://psasir.upm.edu.my/id/eprint/7016/1/On%20the%20chromaticity%20of%20complete%20multipartite%20graphs%20with%20certain%20edges%20added.pdf http://psasir.upm.edu.my/id/eprint/7016/ http://dx.doi.org/10.1016/j.disc.2008.12.008 |
_version_ |
1643823597710475264 |
score |
13.251813 |