排序方式: 共有1条查询结果,搜索用时 31 毫秒
1
1.
关于图的星色数的一点注记 总被引:1,自引:0,他引:1
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. 相似文献
1