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

Algorithm for Strong Vertex-distinguishing Total Coloring of Circle Graphs

作　　者：赵焕平[1] 

机构地区：[1]南阳理工学院计算机与信息工程学院,河南南阳473004

出　　处：《计算机与现代化》2013年第9期23-26,共4页Computer and Modernization

基　　金：国家自然科学基金资助项目(10771091)

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

关 键 词：点可区别强全染色 点可区别强全色数 组合构造算法 圈图 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]