本文中,我们构造性地证明了:对应于每一个给定的色唯一的连通顶点可迁图,均存在着无穷多个与之对应的非色唯一的连通顶点可迁图.据此。我们部分地回答了G.L.chia在[4]中提出的第二个问题。
In this paper, we by construction show that there are infinite connected vertex-transitive graphs which are not chromatically unique corresponding to any given connected vertex- transitive graphs which is chromatically unique. This answers the second question in [4] partly.