论文信息 - Two classes of chromatically unique graphs

Two classes of chromatically unique graphs

Abstract Let P(G;λ) denote the chromatic polynomial of a graph G. G is chromatically unique if G is isomorphic to H for any graph H with P(H;λ) = P(G;λ). In this pasper, we provide two new classes of chromatically unique graphs.

K. M. Koh | B. H. Goh | K. Koh | B. Goh

[1] Chong-Yun Chao,et al. On chromatic equivalence of graphs , 1978 .

[2] G. L. Chia. A note on chromatic uniqueness of graphs , 1986 .

[3] Pablo M. Salzberg,et al. On the chromatic uniquenes of bipartite graphs , 1986, Discret. Math..

[4] Lian-Chang Zhao,et al. Cutpoints and the chromatic polynomial , 1984, J. Graph Theory.

[5] Lian-Chang Zhao,et al. Chromatic uniqueness and equivalence of K4 homeomorphs , 1984, J. Graph Theory.

[6] Chia Gek Ling. The chromaticity of some families of complete tripartite graphs , 1988 .

[7] H. Whitney. A logical expansion in mathematics , 1932 .

[8] R. Read. An introduction to chromatic polynomials , 1968 .

[9] Chong-Yun Chao,et al. On maximally saturated graphs , 1982, Discret. Math..

[10] Ruth A. Bari,et al. Chromatic polynomials and whitney's broken circuits , 1977, J. Graph Theory.

[11] E. J. Farrell,et al. On chromatic coefficients , 1980, Discret. Math..

[12] Shaoji Xu,et al. The chromaticity of wheels , 1984, Discret. Math..

[13] Chong-Yun Chao,et al. Chromatically unique graphs , 1979, Discret. Math..

[14] Chia Gek Ling. Some remarks on the chromatic uniqueness of graphs , 1988 .

[15] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[16] Beatrice Loerinc. Chromatic uniqueness of the generalized θ-graph , 1978, Discret. Math..