图的点和可约边染色  

The Vertex Sum Reducible Edge Coloring for Graphs

作　　者：李敬文[1] 康玉梅 张树成 罗榕 LI Jingwen;KANG Yumei;ZHANG Shucheng;LUO Rong(School of Electronic and Information Engineering,Lanzhou Jiaotong University,Lanzhou 730070,Gansu,China)

机构地区：[1]兰州交通大学电子与信息工程学院,甘肃兰州730070

出　　处：《武汉大学学报（理学版）》2022年第5期487-495,共9页Journal of Wuhan University:Natural Science Edition

基　　金：国家自然科学基金资助项目(11961041,62062049,11461038)

摘　　要：在已有图染色概念基础之上,结合实际问题提出了点和可约边染色的概念,设计了一种新型的点和可约边染色(vertex sum reducible edge coloring)算法,该算法使用逐步趋向最优解方法对随机图的染色进行研究。通过对实验结果进行分析,得到了若干定理及证明。Based on the existing concept of graph coloring and combined with practical problems,the concept of vertex sum reducible edge coloring is proposed,and a novel vertex sum reducible edge coloring algorithm is designed,which uses a stepwise approach to the optimal solution method to study the coloring of random graphs.Through the analysis of experimental results,several theorems and proofs are obtained.

关 键 词：图 算法 点和可约边染色 点和可约边色数 

分 类 号：O157.5[理学—数学]