# zbMATH — the first resource for mathematics

Chromatic equivalence classes of certain generalized polygon trees. III. (English) Zbl 1021.05035
Summary: Let $$P(G)$$ denote the chromatic polynomial of a graph $$G$$. Two graphs $$G$$ and $$H$$ are chromatically equivalent, if $$P(G)=P(H)$$. A set of graphs $${\mathcal S}$$ is called a chromatic equivalence class if any graph $$H$$ that is chromatically equivalent with a graph $$G$$ in $${\mathcal S}$$, also belongs to $${\mathcal S}$$. In Part I Y.-H. Peng et al. [Discrete Math. 172, 103-114 (1997; Zbl 0883.05058)] studied the chromatic equivalence classes of certain generalized polygon trees. In this Part III, we continue that study and present a solution to Problem 2 in K. M. Koh and K. L. Teo [Discrete Math. 172, 59-78 (1997; Zbl 0879.05031)]. Part II has been submitted for publication.

##### MSC:
 05C15 Coloring of graphs and hypergraphs
Full Text:
##### References:
 [1] Chao, C.Y.; Zhao, L.C., Chromatic polynomials of a family of graphs, Ars combin., 15, 111-129, (1983) · Zbl 0532.05027 [2] Koh, K.M.; Teo, K.L., The search for chromatically unique graphs, Graphs and combinatorics, 6, 259-285, (1990) · Zbl 0727.05023 [3] Koh, K.M.; Teo, K.L., The search for chromatically unique graphs, II, Discrete math., 172, 59-78, (1997) · Zbl 0879.05031 [4] Omoomi, B.; Peng, Y.H., Chromatic equivalence classes of certain cycles with edges, Discrete math., 232, 175-183, (2001) · Zbl 0971.05040 [5] B. Omoomi Y.H. Peng, Chromatic equivalence classes of certain generalized polygon trees, II, submitted for publication. · Zbl 1072.05024 [6] Peng, Y.H.; Little, C.H.C.; Teo, K.L.; Wang, H., Chromatic equivalence classes of certain generalized polygon trees, Discrete math., 172, 103-114, (1997) · Zbl 0883.05058 [7] Whitney, H., A logical expansion in mathematics, Bull. amer. math. soc., 38, 572-579, (1932) · JFM 58.0605.08 [8] Xu, S.J.; Liu, J.J.; Peng, Y.H., The chromaticity of s-bridge graphs and related graphs, Discrete math., 135, 349-358, (1994) · Zbl 0814.05036
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.