ON CHROMATIC EQUIVALENCE OF A FAMILY OF -HOMEOMORPHS

S. Catada-Ghimire (Malaysia), H. Roslan (Malaysia) and Y. H. Peng (Malaysia)

Received May 12, 2008

References:

[1] C. Y. Chao and L. C. Zhao, Chromatic polynomials of a family of graphs, Ars Combin. 15 (1983), 111-129. [2] X. E. Chen and K. Z. Ouyang, Chromatic classes of certain 2-connected -graphs homeomorphs to Discrete Math. 172 (1997), 17-29. [3] K. M. Koh and K. L. Teo, The search for chromatically unique graphs, Graphs Combin. 6 (1990), 259-285. [4] W. M. Li, Almost every -homeomorphs is chromatically unique, Ars Combin. 23 (1987), 13-36. [5] Y.-I. Peng, Some new results on chromatic uniqueness of -homeomorphs, Discrete Math. 288 (2004), 177-183. [6] Y.-I. Peng, Chromaticity of family of -homeomorphs, Personal Communication, 2006. [7] Y.-I. Peng, Chromatic uniqueness of a family of -homeomorphs, Discrete Math., 2008, in press. [8] Y.-I. Peng, On the chromatic equivalence classes of , J. Qinghai Normal Univ. 4 (2003), 1-3 (in Chinese). [9] Y.-I. Peng and Zengyi, On the chromatic equivalence of two families -homeomorphs, J. Suzhou Sci. Technol. Univ. 4 (2004), 31-34 (in Chinese). [10] E. G. Whitehead, Jr. and L.C. Zhao, Chromatic uniqueness and equivalence of -homeomorphs, J. Graph Theory. 8 (1984), 355-364. [11] S. Xu, A lemma in studying chromaticity, Ars Combin. 32 (1991), 315-318.

Keywords and phrases: chromatic polynomial, chromatic equivalence, -homeomorphs.