A Note on Graph Colorings and Graph Polynomials
暂无分享，去创建一个
It is known that the chromatic number of a graphG=(V,E) withV={1, 2, ?, n} exceedskiff the graph polynomialfG=?ij?E, i
[1] Tommy R. Jensen,et al. Graph Coloring Problems , 1994 .
[2] Noga Alon,et al. Colorings and orientations of graphs , 1992, Comb..
[3] László Lovász,et al. Bounding the Independence Number of a Graph , 1982 .
[4] Kenneth Appel,et al. The Four-Color Problem , 1978 .