On the adjacent vertex distinguishing total coloring numbers of graphs with Delta=3
On the adjacent vertex distinguishing total coloring numbers of graphs with Delta=3
复制标题
DOI：
10.1016/j.disc.2007.07.091
复制
发表时间：
2008-09
期刊：
影响因子：
--
通讯作者：
Xiangen Chen
中科院分区：
文献类型：
--
作者：
Xiangen Chen
简单图G的邻点可区别全染色是G的真全染色，使得没有一对邻接顶点满足相同的色集。研究了给G一个邻点可区别全染色所需的最小色数χa“(G)。本文证明了χa“(G)⩽6是最大度Δ(G)=3的图。
An adjacent vertex distinguishing total-coloring of a simple graph G is a proper total-coloring of G such that no pair of adjacent vertices meets the same set of colors. The minimum number of colors χa″(G) required to give G an adjacent vertex distinguishing total-coloring is studied. We proved χa″(G)⩽6 for graphs with maximum degree Δ(G)=3 in this paper.