Hong Yong FUDe Zheng XIE College of Mathematics and StatisticsChongqing UniversityChongqing PRChinaCollege of Economics and Business AdministrationChongqing UniversityChongqing PRChina
论文数: 0引用数: 0
h-index: 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
]
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.