圈图的点可区别强全染色算法

Algorithm for Strong Vertex-distinguishing Total Coloring of Circle Graphs

针对圈图的点可区别强全染色的特点,提出一种组合构造算法,证明并得到给定点的圈图的点可区别强全色数。实验结果表明,该算法能有效地解决圈图的点可区别强全染色问题。

According to the feature of strong vertex-distinguishing total coloring of circle graphs,the paper propoees an algorithm model,in the model there are two situations of three-four adjacent or three-five adjacent for any two adjacent points.Using the model to design a combinatorial construction algorithm,the algorithm is proved to get the strong vertex-distinguishing total chromatic number of circle graphs of given points.The experimental results show that this algorithm can effectively solve the problem of strong vertex-distinguishing total coloring of circle graphs.