A Note on Chromatic Uniqueness of Completely Tripartite Graphs
Received:January 14, 2008  Revised:July 07, 2008
Key Words: complete tripartite graph   chromatic polynomial   chromatic uniqueness   color partition.  
Fund Project:Supported by the National Natural Science Foundation of China (Grant No.10771091) and the Science and Research Project of the Education Department of Gansu Province (Grant No.0501-02).
Author NameAffiliation
Ke Yi SU Yinchuan Sixth Middle School, Ningxia 750011, P. R. China
College of Mathematics and Information Science, Northwest Normal University, Gansu 730070, P. R. China 
Xiang En CHEN College of Mathematics and Information Science, Northwest Normal University, Gansu 730070, P. R. China 
Hits: 3863
Download times: 2876
Abstract:
      
Citation:
DOI:10.3770/j.issn:1000-341X.2010.02.005
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.