期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
The Complete Chromatic Number of Some Planar Graphs~* 被引量:1
1
作者 张忠辅 王建方 +1 位作者 王维凡 王流星 《Science China Mathematics》 SCIE 1993年第10期1169-1177,共9页
Let G be a planar graph without cut vertex, let X_c(G) be the vertex, edge, face-complete chromatic number of G and let p=|V(G)|. This paper proves X_c(G)=Δ(G)+1 if G is an outerplanar graph with Δ(G)≥7, or a high ... Let G be a planar graph without cut vertex, let X_c(G) be the vertex, edge, face-complete chromatic number of G and let p=|V(G)|. This paper proves X_c(G)=Δ(G)+1 if G is an outerplanar graph with Δ(G)≥7, or a high degree planar graph with p≥9 and Δ(G)≥p-2 or a maximal planar graph with Δ(G)≥14. 展开更多
关键词 outerplanar GRAPH high degree PLANAR GRAPH MAXIMAL PLANAR GRAPH COMPLETE CHROMATIC number
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部