期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
Some Planar Graphs with Star Chromatic Number Between Three and Four
1
作者 李德明 《Journal of Mathematical Research and Exposition》 CSCD 北大核心 2001年第4期500-504,共5页
We construct sonic infinite family of planar graphs with star chromatic number, where, partially answering a question of Vince,
关键词 (k d)-coloring star chromatic number planar graph
下载PDF
A Note on Star Chromatic Number of Graphs 被引量:1
2
作者 Hong Yong FU De Zheng XIE 《Journal of Mathematical Research and Exposition》 CSCD 2010年第5期841-844,共4页
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... 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 A, then xs(G) ≤ [7△3/2]], which gets better bound than those of Fertin, Raspaud and Reed. 展开更多
关键词 star coloring star chromatic number proper coloring.
下载PDF
The Star Chromatic Numbers of Some Planar Graphs Derived from Wheels
3
作者 LI De Ming Department of Mathematics. Capital Normal University. Beijing 100037. P. R. China 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2002年第1期173-180,共8页
The notion of the star chromatic number of a graph is a generalization of the chromatic number. In this paper. we calculate the star chromatic numbers of three infinite families of planar graphs. The first two familie... The notion of the star chromatic number of a graph is a generalization of the chromatic number. In this paper. we calculate the star chromatic numbers of three infinite families of planar graphs. The first two families are derived from a 3-or 5-wheel by subdivisions. their star chromatic numbers being 2+2/(2n + 1). 2+3/(3n + 1)and 2+3/ (3n - 1), respectively. The third family of planar graphs are derived from n odd wheels by Hajos construction with star chromatic numbers 3 + 1/n. which is a generalization of one resnlt of Gao et al. 展开更多
关键词 (k d)-coloring star chromatic number Planar graph
原文传递
Star-Chromatic Numbers of Planar Graphs 被引量:2
4
作者 WANG Yijiu Institute of Operations Research,Qufu Normal university,273165 《Systems Science and Systems Engineering》 CSCD 1998年第2期63-66,共4页
The concept of the star chromatic number of a graph was introduced by A.Vince in ,which is a natural generalizition of the chromatic number of a graph.In this paper,we investigate the star chromatic number of a famil... The concept of the star chromatic number of a graph was introduced by A.Vince in ,which is a natural generalizition of the chromatic number of a graph.In this paper,we investigate the star chromatic number of a family of planar graphs.More precisely, a family of planar graphs whose star chromatic numbers are between 2 and 3 are disscused,which answers the open problem posed by Vince in . 展开更多
关键词 star chromatic number planar graph cycle star graph
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部