连通的顶点可迁图的色唯一性

Chromatic Uniqueness of Connected Vertex-Transitive Graphs

本文给出从一个已知的顶点可迁的非色唯一图出发,构造无穷多个顶点可迁的非色唯一图的一种方法,据此给出若干类无穷多个连通的顶点可迁,但不是色唯一的图簇,从而进一步否定地回答了Chia在[1]中提出的问题.

In this paper is introduced 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 the graphs are also given. This answers a problem of Chia[1] in the negative.