1) vertex-edge-face complete chromatic number
点边面完备色数
2) complete chromatic number
完备色数
1.
In this paper, it has been proved that the complete chromatic number of maximum outerplanar graphs with △=6 is 7.
证明了最大度为6的极大外平面图的完备色数为7。
2.
In this paper, we provedthat if G is an open outerpanar graph with Δ(G)≥6 then Xc(G)= Δ(G)+1, whereXc(G) is the complete chromatic number of G and Δ(G)the maximum degree of verticesof G.
平面图Ｇ（Ｖ，Ｅ，Ｆ）的完备色数Ｘｃ（Ｇ）是使得集合Ｖ（Ｇ）∪Ｅ（Ｇ）∪Ｆ（Ｇ）中的相邻点，相邻边、相邻面、相关联的点边、相关联的点面及相关联的边面均染为不同颜色的最少颜色数，一个无割点的外平面称为开外平面图，如果它的每一个内面的边界至少含一条外边。
3) edge-face chromatic number
边面色数
4) vertex-edge total chromatic number
点边全色数
5) edge-face total Chromatic number
边面全色数
1.
In this paper, the edge-face total chromatic number of Halin graphs are obtained for Δ(H_g)≥7 and Δ(H_g) = 4,5,6 , where Δ(H_g) denote maximum degree of Halin graph H_g.
本文证明了△(Hg)≥7及△(Hg)=4、5、6时,Halin图Hg的边面全色数。
6) edge face chromatic number
边面全色数
1.
In this paper we give the best upper and lower bounds of the edge face chromatic number χ ef for all 1-trees.
本文确定了所有1-树的边面全色数的精确上、下界,并且求出了2-连通且最大度至少为6平面图的边面全色
补充资料：边面
1.边境;边疆。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条