摘要
如果图G的一个正常边染色满足相邻点的色集不同,且任意两种颜色所染边数目相差不超过1,则称为均匀邻强边染色,其所用最少染色数称为均匀邻强边色数.本文得到了路、圈、星和扇的Mycielski图的均匀邻强边色数.
A proper edge coloring of graph G is called equitable adjacent strong edge coloring if colored sets from every two adjacent vertices incident edge are different,and the number of edges in any two color classes differ by at most one,which the required minimum number of colors is called the equitable adjacent strong edge chromatic number.In this paper,we obtain the equitable adjacent strong edge chromatic numbers of mycielski graphs of pan,cycle,star,and fan.
出处
《纯粹数学与应用数学》
CSCD
2010年第4期581-586,共6页
Pure and Applied Mathematics
基金
国家自然科学基金(40301037)
国家民委科研项目(05XB07)
西北民族大学中青年科研基金(X2007-012)
关键词
MYCIELSKI图
均匀邻强边染色
均匀邻强边色数
Mycielski graph
equitable adjacent strong edge coloring
equitable adjacent strong edge chromatic number
