HEADERS
搜索
A Note on Star Chromatic Number of Graphs
引用
打印
摘要: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 Xs(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 Xs(G)≤[7△3/2],which gets better bound than those of Fertin,Raspand and Reed.
分类号:
O157.5(代数、数论、组合理论)
在线出版日期:
2010-11-04 (万方平台首次上网日期,不代表论文的发表时间)
英文信息
FOOTERS