CIRCULAR CHROMATIC NUMBER OF SOME SPECIAL GRAPHS

被引：0
|
作者：
Gao, Wei [1 ,2 ]
Zhang, Yungang [1 ,3 ]
Yan, Chengchao [4 ]
机构：
[1] Yunnan Normal Univ, Dept Informat, Kunming 650092, Yunnan, Peoples R China
[2] Soochow University, Dept Math, Suzhou 215006, Jiangsu, Peoples R China
[3] Univ Liverpool, Dept Comp Sci, Liverpool L69 3BX, Merseyside, England
[4] Zhejiang Normal Univ, Dept Math, Phys & Informat Engn, Jinhua 321004, Zhejiang, Peoples R China
来源：
PROCEEDINGS OF THE 2011 3RD INTERNATIONAL CONFERENCE ON FUTURE COMPUTER AND COMMUNICATION (ICFCC 2011) | 2011年
基金：
中国国家自然科学基金;
关键词：
Circular chromatic number; Circular list chromatic number; Generalized circle; C-n(m); r-corona graph; Star-extremal graph; CHOOSABILITY;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The circular chromatic number of a graph is a natural generalization of the chromatic number. Circular chromatic number contains more information about the structure of a graph than chromatic number does. In this paper we obtain the circular chromatic number and circular list chromatic number of special graphs such as generalized circle, C-n(m), and their r-corona graphs. It is also show that there are all star-extremal graphs.
引用
收藏
页码：311 / +
页数：2
相关论文
共 50 条
12345