摘要
图G的一个正常全染色如果满足G中任意路长为2的点和边着色均不相同,称为G的星全染色.图的全部k-星全染色中所用最少的颜色数称为图G的星全色数.文章研究了若干联图的星全色数.
A-proper total coloring of graph is called the star total coloring of,if the vertices and edges of any path of the length of two receive distinct colors,the minimum number of spanning over all-star-total-colorings of is called the star total chromatic number of.The star total chromatic number of some join of graphs is studied in this paper.
出处
《西北民族大学学报（自然科学版）》
2010年第4期16-18,共3页
Journal of Northwest Minzu University(Natural Science)
基金
国家民委社科基金(08XB07)
关键词
联图
星全染色
星全色数
join of two graphs
star total coloring
star total chromatic number
