围长至少为6的平面图的邻点可区别边染色  

Adjacent Vertex Distinguishing Edge Coloring of Planar Graphs with Girth at Least 6

作　　者：何正月 梁立[2] 高炜[2] HE ZHENGYUE;LIANG LI;GAO WEI(School of Computer Science and Technology,Zhejiang Normal University,Jinhua 321004,China;School of Information Science and Technology,Yunnan Normal University,Kunming 650500,China)

机构地区：[1]浙江师范大学计算机科学与技术学院,金华321004 [2]云南师范大学信息学院,昆明月650500

出　　处：《应用数学学报》2024年第1期45-55,共11页Acta Mathematicae Applicatae Sinica

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

摘　　要：邻点可区别边染色是指图G有一个正常边染色且任意两个相邻顶点的颜色集合不相等.邻点可区别边色数是指使图G有一个邻点可区别边染色的最小颜色数值,记作χα’(G).本文证明了:若图G是围长至少为6的正常平面图,则有χα’(G)≤max{6,△(G)+1}.An adjacent vertex distinguishing edge coloring of graph G is a proper edge coloring of G such that any pair of adjacent vertices have distinct sets of colors.The mininum number of colors required for an adjacent vertex distinguishing edge coloring of G is denoted byχ_α'(G).This paper proves that G is a normal planar graph with girth at least 6,χ_α'(G)≤max{6,△(G)+1}.

关 键 词：邻点可区别边染色 围长 平面图 最大度 

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