摘要: 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 bi-cycle graph and a second class bicycle graph(the Theorem 2), respectively.
中图分类号:
马海成, 刘慧敏, 张海良. 色多项式对图的刻画[J]. 数学季刊, 2009, 24(1): 46-52.
MA Hai-cheng, LIU Hui-min, ZHANG Hai-liang. Graph Description by the Chromatic Polynomials [J]. Chinese Quarterly Journal of Mathematics, 2009, 24(1): 46-52.