摘要
通过引入一类点集划分的概念,研究了Mylielski图循环染色的性质,证明了当完全图的点数足够大时,它的Mycielski图的循环色数与其点色数相等.
In this paper, based on introducing a special kind of partition of the vertex set of Mycielski graphs and some new concepts, the characters of the circular coloring of Mycielski graphs are analyzed. These characters are then employed to show that the circular chromatic number of Mycielski graph of complete graphs equals to its chromatic number when the order of complete graph is big enough.
出处
《数学杂志》
CSCD
北大核心
2006年第3期255-260,共6页
Journal of Mathematics
基金
Supported by the Foundation of Natural Science of China(10371048)and theFoundation of Three Gorges University.
关键词
循环色数
MYCIELSKI图
色数
circular chromatic number
Mycielski graph
chromatic number
