摘要
探讨了简单图Ｇ＝（Ｎ，Ｅ）中不邻接点的着色问题，给出连通的简单图中，点对偶在ｒ（Ｇ）＝ｋ着色中为同色和异色的性质，色数的存在区间等，提出了求简单图色数的一种较有效的算法．
The coloured problem of the non-adjacent point in the simple graph G =(N,E) is discussed. The properties of point antitheses with same and different color in r(G)= K colouring in the connected simple graph, and the chromatic number's existent region, etc. are given. A more effective algorithm about chromatic number in the simple graph is put forward.
关键词
点对偶
图
简单图
着色定理
色数
算法
Point antithesis
Sign vertex
Adjacent degree
Chain-graph
