Classes of chromatically equivalent graphs and polygon trees

Abstract We give the definition of complete classes of chromatically equivalent graphs and some results on this topic. We give an invariant for generalized polygon tree under chromatic equivalence, which is useful in searching for chromatically equivalent graphs. As a consequence we show that {{ C i o ,…, C i , k }, k { K > 2 }} is a complete class of a chromatically equivalent graphs, which solves a problem raised in Whitehead Jr (1988).

[1]  Chong-Yun Chao,et al.  On q-trees , 1986, J. Graph Theory.

[2]  Earl Glen Whitehead,et al.  Chromaticity of two-trees , 1985, J. Graph Theory.

[3]  Earl Glen Whitehead.  Chromatic polynomials of generalized trees , 1988, Discret. Math..

[4]  Kee L. Teo,et al.  The search for chromatically unique graphs , 1990, Graphs Comb..

[5]  Chong-Yun Chao,et al.  On trees of polygons , 1985 .

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

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

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