|
| 摘要: |
| 本文研究了最大度为3 且没有相邻最大度的图的邻点可区别全染色. 利用边剖分的方法, 构造了此类图更为一般的情形, 得到了它们的邻点可区别全色数的上界. 目前, 未找到最大度为3 的图且它的邻点可区别全色数是6. 本文的结果部分地回答了这个问题. |
| 关键词: 全染色 邻点可区别全染色 |
| DOI： |
| 分类号:O157.5 |
| 基金项目:Supported by National Natural Science Foundation of China (61163054;61363060;61163037) |
|
| ADJACENT VERTEX DISTINGUISHING TOTAL COLORINGS OF GRAPHS WITH SMALLER DEGREES |
|
YANG Chao,YAO Bing,WANG Hong-yu,CHEN Xiang-en
|
| Abstract: |
| In this paper, we study the adjacent vertex distinguishing total colorings of graphs with maximum degree three and no adjacent Δ-vertices. By the technique of splitting edges, graphs with more special situations are constructed. And then we obtain the upper bound of adjacent vertex distinguishing total chromatic numbers of these graphs. Up to present graph having maximum degree three such that its adjacent vertex distinguishing total chromatic number is six has been reported in current literature, our conclusion answers this problem partially. |
| Key words: total colorings adjacent vertex distinguishing total colorings |
