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
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
Elsevier
2008
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/7016/1/On%20the%20chromaticity%20of%20complete%20multipartite%20graphs%20with%20certain%20edges%20added.pdf |