Let P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically equivalent, written G ∼ H, if P(G) = P(H). Let g denote the family of all generalized polygon trees with three interior regions. Xu (1994) showed that g is a union of chromatic equivalence classes under the equivalence relation '∼'. In this paper, we determine infinitely many chromatic equivalence classes in g under '∼'. As a byproduct, we obtain a family of chromatically unique graphs established by Peng (1995).
CITATION STYLE
Peng, Y. H., Little, C. H. C., Teo, K. L., & Wang, H. (1997). Chromatic equivalence classes of certain generalized polygon trees. Discrete Mathematics, 172(1–3), 103–114. https://doi.org/10.1016/S0012-365X(96)00273-7
Mendeley helps you to discover research relevant for your work.