A Note on Star Chromatic Number of Graphs

被引：0
|
作者：
Hong Yong FUDe Zheng XIE College of Mathematics and StatisticsChongqing UniversityChongqing PRChinaCollege of Economics and Business AdministrationChongqing UniversityChongqing PRChina [1 ,2 ,1 ,1 ,401331 ,2 ,400044 ]
机构：
来源：
数学研究与评论 | 2010年 / 30卷 / 05期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A star coloring of an undirected graph G is a proper coloring of G such that no path of length 3 in G is bicolored.The star chromatic number of an undirected graph G,denoted by χs(G),is the smallest integer k for which G admits a star coloring with k colors.In this paper,we show that if G is a graph with maximum degree △,then χs(G) ≤ [7△3/2],which gets better bound than those of Fertin,Raspaud and Reed.
引用
收藏
页码：841 / 844
页数：4
相关论文
共 50 条
12345