摘要
如果图G的一个正常全染色满足任意两种颜色所染元素(点或边)数目相差不超过1,则称为G的均匀全染色,其所用最少染色数称为均匀全色数.本文得到了星、扇和轮的倍图的均匀全色数.
A proper total-coloring of graph G is said to be equitable if the number of elements (vertices and edges) in any two color classes differ by at most one,which the required minimum number of colors is called the equitable total chromatic number.In this paper,we derive the equitable total chromatic numbers of double graphs of star,fan and wheel.
出处
《数学研究》
CSCD
2009年第1期40-44,共5页
Journal of Mathematical Study
基金
Youth Science Foundation of Northwest University for Natjonalities(X2007-012)
National Nationalities Commission Science Foundation of China(05XB07)
NSFC(40301037)
关键词
倍图
均匀全染色
均匀全色数
double graph
equitable total coloring
equitable total chromatic number
