摘要
本文证明了删去轮形图的一些轮辐得到的两类图是色唯一的。
Two families of chromatically unique graphs are given in this paper. The first family is the graph of order n obtained from the wheel W. by deleting n—6 comsecutive spokes. The second family is the graph of order 2n obtained from the wheel W_(2n) by deleting one spoke.
出处
《黄冈师范学院学报》
1993年第2期1-4,共4页
Journal of Huanggang Normal University
关键词
轮形图
色多项式
色唯一
色等价
Wheel
Chromatic polynomials
Chromatically equivalent
chromatically unique
