Graph Description by the Chromatic Polynomials  

作　　者：MA Hai-cheng LIU Hui-min ZHANG Hai-liang 

机构地区：[1]Department of Mathematics, Qinghai Nationalities University, Xining 810007, China [2]Department of Mathematics, Qinghai Normal University, Xining 810007, China

出　　处：《Chinese Quarterly Journal of Mathematics》2009年第1期46-52,共7页数学季刊（英文版）

基　　金：Supported by the NNSF of China(10861009);Supported by the Ministry of Education Science and Technology Item of China(206156)

摘　　要：By means of the chromatic polynomials, this paper provided a necessary and sufficient condition for the graph G being a mono-cycle graph（the Theorem 1）, a first class hi-cycle graph and a second class bicycle graph（the Theorem 2）, respectively.

关 键 词：mono-cycle graph bi-cycle graph chromatic polynomial chromatic equivalence 

分 类 号：O157.5[理学—数学] TH132.41[理学—基础数学]