摘要
图G(超图H)的全着色是指同时给图中的顶点和边进行着色,使相关联或相邻的元素间着不同的颜色,而使用的最少的颜色数就称为全色数,记为χT(G)(χT(H)).超图的全着色又可以分成弱全着色和强全着色2种情况.本文主要讨论超图中轮形图W(v)的全着色性质,并得到具体的强全色数和弱全色数,χTW(W(v))=Δ+1,χTS(W(v))=M+1.
The total chromatic number χT（H） of hypergraph H is the minimum number of colors needed to color the vertices and edges of H so that the incident or adjacent elements have distinct colors.The total coloring of hypergraph contains weak total coloring and strong total coloring.In the paper,the characteristics of the total colorings of wheel W（v） were discussed,and the chromatic numbers of them,χWT（W（v））=Δ＋1,χST（W（v））= M＋1 were obtained.
出处
《海南大学学报（自然科学版）》
CAS
2011年第1期8-10,19,共4页
Natural Science Journal of Hainan University
关键词
轮形图
全着色
弱全色数
强全色数
wheels
total coloring
weak total chromatic number
strong total chromatic number
