摘要
如果图G的一个正常顶点染色满足任两个色类中的顶点数相差不超过1,则称为G的均匀染色.研究了一些Mycielski图的均匀染色,给出了路、圈、完全图和广义星图的Mycielski图的均匀色数.
A proper vertex coloring of a graph G is equitable if the size of the color classes differ by at most one. In this paper, we investigated the equitable coloring problem for some Mycielski＇s graphs, and obtained the equitable chromatic number for Mycielski＇s graphs of path, cycle, complete graph and generalized star.
出处
《数学的实践与认识》
北大核心
2017年第24期127-131,共5页
Mathematics in Practice and Theory
基金
国家自然科学基金(11701542)
