色多项式对图的刻画

摘要

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.