## Chromaticity of certain tripartite graphs identified with a path

- G. C. Lau, Y. H. Peng
- Discrete Mathematics
- 2006

@article{Chia2001OnTC, title={On the Chromatic Uniqueness of Edge-Gluing of Complete Bipartite Graphs and Cycles}, author={Gek Ling Chia and Chee-Kit Ho}, journal={Ars Comb.}, year={2001}, volume={60} }

- Published 2001 in Ars Comb.

In this paper, it is shown that the graph obtained by overlapping the cycle and the complete tripartite graph at an edge is uniquely determined by its chromatic polynomial. ) 3 ( ≥ m Cm 2 , 2 , 2 K Let G be a finite graph with neither loops nor multiple edges and let ) ; ( λ G P denote its chromatic polynomial. Then G is said to be chromatically unique if ) ; ( ) ; ( λ λ G Y P = implies that Y is isomorphic to G. Let n K and denote a complete graph and a cycle respectively on n vertices. The… CONTINUE READING