Liu, Ruying; Li, Nianzu Chromatic uniqueness of connected vertex-transitive graphs. (Chinese. English summary) Zbl 0891.05033 Math. Appl. 4, No. 2, 50-53 (1991). Summary: We introduce a method of constructing an infinite number of connected vertex-transitive and not chromatically unique graphs based on one such known graph by which several families of graphs are also given. This answers a question of G. L. Chia [J. Graph Theory 10, 541-543 (1986; Zbl 0616.05035)] in the negative. Cited in 3 Documents MSC: 05C15 Coloring of graphs and hypergraphs Keywords:connected vertex-transitive; chromatically unique graphs PDF BibTeX XML Cite \textit{R. Liu} and \textit{N. Li}, Math. Appl. 4, No. 2, 50--53 (1991; Zbl 0891.05033)