关于连通点可迁图的色性

ON THE CHROMATICITY OF CONNECTED VERTEX-TRANSITIVE GRAPHS

摘要: Chia G L在1986年提出了这样1个问题:所有连通点可迁图是否是色唯一的?本文给出了一族连通点可迁图,它们都不是色唯一的,否定地回答了这个问题。

Abstract: In 1986,Chia G L posed such a problem.are all the connected vertex-transitive graphs chromatically unique? A family of connected vertex-transitive graphs is given in this paper. This answer in the negative the problem of Chia.