DocumentCode :
2260455
Title :
A Method to Find Chromatically Unique Multipartite Graphs
Author :
Zhao, Haixing ; Gao, Zhuma ; Yin, Jun
Author_Institution :
Dept. of Comput. Sci., Qinghai Normal Univ., Xining, China
fYear :
2010
fDate :
11-14 Dec. 2010
Firstpage :
629
Lastpage :
633
Abstract :
In this paper, our main goal is to investigate chromaticity of the general multipartite graphs. A method to find chromatically unique multipartite graphs is obtained. By the method, we give some chromatically unique multipartite graphs.
Keywords :
graph theory; chromatically unique multipartite graph; chromaticity; general multipartite graph; chromatic polynomials; chromatic uniqueness; chromatically closed; complete multipartite graph;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Intelligence and Security (CIS), 2010 International Conference on
Conference_Location :
Nanning
Print_ISBN :
978-1-4244-9114-8
Electronic_ISBN :
978-0-7695-4297-3
Type :
conf
DOI :
10.1109/CIS.2010.143
Filename :
5696359
Link To Document :
بازگشت