Chromatically equivalent graphs
暂无分享,去创建一个
Let G,H be graphs, and P(G,λ), P(H,λ) be the chromatic polynomials of G,H respectively. Then G is chromatically equivalent to H, (written P Open image in new window H), if P(G,λ) = P(H,λ).
[1] Frank Harary,et al. Graph Theory , 2016 .
[2] Hassler Whitney,et al. The Coloring of Graphs , 1932 .
[3] Tom Brylawski,et al. Reconstructing combinatorial geometries , 1974 .
[4] W. T. Tutte. On chromatic polynomials and the golden ratio , 1970 .
[5] N. Sloane,et al. Proof Techniques in Graph Theory , 1970 .