修改一类G着色图的一个算法(英文)

Algorithm that modifies a kind of G colored graph

给出了修改一类G着色图的一算法 ,并证明了通过第n次循环获得的G_Vo的第n +1个着色图一定不同于前n个G_Vo的着色图中的任何一个 。

In this paper gives an algorithm to modify G colored graph,and prove that the ( n +1) th colored graph obtained by the n th iteration must be different from any of the n colored graphs,and that the iteration of the algorithm with two same components can't perform infinitly.