摘要
图的邻点可区别全染色,相对于图的正常全染色有更强的要求,因为它要求相邻顶点具有不同的颜色集合.本文刻画了两类特殊的完全多部图、广义圈和广义Mycielski图的邻点可区别全色数.
The adjacent vertex-distinguishing total coloring of a graph satisfies the condition that the color sets of adjacent vertexes are different. This kind of coloring has stronger restrain than the proper total coloring. In this paper, the adjacent vertex-distinguishing total chromatic number of two special classes of complete r-partite, generalized circles and generalized Mycielski＇s graph are presented.
出处
《河南科学》
2006年第4期477-479,共3页
Henan Science
基金
国家自然科学基金资助项目(10471131)
浙江省自然科学基金资助项目(102055)
关键词
正常点染色
正常边染色
正常全染色
邻点可区别全染色
邻点可区别全色数
proper vertex coloring
proper edge coloring
proper total coloring
adjacent vertex-distinguishing total coloring
adjacent vertex-distinguishing total chromatic number
