摘要
证明文献〔１〕提出的关于反色数上界的猜想，得到了带宽与反色数有关的下界，并给出了几类图的反色数．
A conjecture raised by [1] is proved in this paper. The lower bound of bandwidth about the reciprocal chromatic number is derived and the reciprocal chromatic number of some graphs is given as well.
出处
《华东交通大学学报》
1996年第3期69-72,76,共5页
Journal of East China Jiaotong University
关键词
图
反色数
带宽
graph: reciprocal chromatic number
independent number
bandwidth
