摘要
对一个正常的全染色满足各种颜色所染元素数(点或边)相差不超过1时,称为均匀全染色,其所用最少染色数称为均匀全色数.将图按均匀全色数分类,证明了简单图在若干情况下的均匀全色数定理,得到了一些联图的均匀全色数.
A total-coloring is called equitable if ｜ ｜Si ｜ - ｜ Sj ｜｜≤ 1, the ｜ Si ｜ is called chromatic number of the color. The minimum number of colors required for an equitable proper totalcoloring, a simple graph G is denoted by xet （G）. In this paper, graphs are classified according to equitable total chromatic number, have proved theorems of equitable total coloring of graph and got equitable total chromatic number of some Join-graphs.
出处
《数学的实践与认识》
CSCD
北大核心
2008年第8期164-168,共5页
Mathematics in Practice and Theory
基金
国家民委科研项目(05XB07)
西北民族大学中青年科研项目(X2007-012)
国家自然科学基金资助项目(40301037)
关键词
图
均匀全染色
均匀全色数
联图
graph
equitable total coloring
equitable total chromatic number
join-graph
