1) edge game chromatic number
边对策色数
1.
This paper introduce the edge game chromatic,and then determines the property of the edge game chromatic number.
对几种特殊图类进行了讨论,分别确定链图,圈图及与圈有关的图,扇图,Petersen图的边对策色数。
2) edge game chromatic
边对策着色
1.
This paper introduce the edge game chromatic,and then determines the property of the edge game chromatic number.
本文介绍了边对策着色,讨论了图G的边对策着色的性质。
2.
Recently a lot of problems have been studied, as follows: game chromatic, edge game chromatic, relaxed game chromatic.
现在广泛研究的问题有:图的点对策着色,图的边对策着色,图的松弛对策着色问题等。
3) game chromatic number
对策色数
1.
In this paper,we obtain the game chromatic number and relaxed game chromatic number of wheel and fan.
讨论了图的二人对策着色和放松对策着色,给出了轮图与扇图的对策色数与放松对策色数。
2.
In this paper,we give a tree with more simple structure whose relaxed game chromatic number is equal to the maximum of the game chromatic number of forests.
给出了放松对策色数能够达到树族放松对策色数最大值且结构非常简单的树。
3.
The game chromatic number Ⅱ of graph was discus se d.
本文讨论了图的色对策 ,给出了外平面图的几个性质 ,并且利用性质证明了外平面图的对策色数至多是
4) game chromatic numberⅡ
对策色数Ⅱ
1.
The game chromatic numberⅡ χ~*_g(G) of graph G is developed from the game chromatic number χ_g(G).
图G的对策色数Ⅱgχ*(G)是由图的点色数gχ(G)拓展而来的。
2.
The game chromatic numberⅡχ~*_g (G) of graph G is developed by the game chromatic numberχ_g(G).
图G的对策色数Ⅱχg(G)是由图的点色数χg(G)拓展而来的。
5) game chromatic number Ⅱ
对策色数Ⅱ
1.
By labeling the vertex of graph with color, this paper determines the chromatic number of cycle and other graphs, And also determines the property of the game chromatic number Ⅱ.
介绍了一种新的色对策Ⅱ和对策染色数Ⅱ，比较了两种色对策的差异，讨论了图G的色对策Ⅱ的性质，对这种图的新不变量，利用顶点标号方法，给出获胜策略，对几种特殊图类进行了讨论，分别确定了路图及补图、圈图Cn及与圈有关的图的对策色数Ⅱ。
2.
Their difference is compared,and the properties of the game chromatic number Ⅱ are discussed.
介绍了一种新的二人对策着色:色对策Ⅱ和对策色数Ⅱ。
6) relaxed game chromatic number
放松对策色数
1.
In this paper,we obtain the game chromatic number and relaxed game chromatic number of wheel and fan.
讨论了图的二人对策着色和放松对策着色,给出了轮图与扇图的对策色数与放松对策色数。
2.
In this paper,we give a tree with more simple structure whose relaxed game chromatic number is equal to the maximum of the game chromatic number of forests.
给出了放松对策色数能够达到树族放松对策色数最大值且结构非常简单的树。
补充资料：边色
1.边地的风物景色。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条