论文标题
某些类别的Cayley图的总颜色
Total Coloring for some classes of Cayley graphs
论文作者
论文摘要
总体着色猜想指出，任何最大程度d的简单图G都可以完全涂上D+2颜色。在本文中，我们获得了某些类别的Cayley图的总色数。
The Total coloring conjecture states that any simple graph G with maximum degree D can be totally colored with at most D+2 colors. In this paper, we have obtained the total chromatic number for some classes of Cayley graphs.
