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
Saved in:
Main Authors: | Lau, G. C., Peng, Y. H. |
---|---|
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 http://psasir.upm.edu.my/id/eprint/7016/ http://dx.doi.org/10.1016/j.disc.2008.12.008 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the Higher Order Edge-Connectivity of Complete Multipartite Graphs
by: Peng, Y. H., et al.
Published: (1989) -
Chromaticity of Certain 2-Connected Graphs
by: Lau, Gee Choon
Published: (2003) -
Chromaticity of Certain Bipartite Graphs
by: Hasni @ Abdullah, Roslan
Published: (2005) -
Chromatic equivalence class of the join of certain tripartite graphs
by: Lau, Gee Choon, et al.
Published: (2007) -
Chromatic uniqueness of turan graph with certain star deleted
by: Lau, Gee Choon, et al.
Published: (2009)