ON THE CHROMATICITY OF CONNECTED VERTEX-TRANSITIVE GRAPHS

Deng Hanyuan. ON THE CHROMATICITY OF CONNECTED VERTEX-TRANSITIVE GRAPHSJ. Transactions of Beijing institute of Technology, 1989, (1).

Citation:

Deng Hanyuan. ON THE CHROMATICITY OF CONNECTED VERTEX-TRANSITIVE GRAPHSJ. Transactions of Beijing institute of Technology, 1989, (1).

Citation:

Deng Hanyuan. ON THE CHROMATICITY OF CONNECTED VERTEX-TRANSITIVE GRAPHSJ. Transactions of Beijing institute of Technology, 1989, (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.

FullText(HTML)

Turn off MathJax

Article Contents

Export File