两个最大度为2的图的边冠积的无圈边染色  

Acyclic edge coloring for the edge corona product of two graphs with maximum degree two

作　　者：金梅芹 田双亮[1] JIN Mei-qin;TIAN Shuang-liang(School of Mathematics and Computer Science,Northwest Minzu University,Lanzhou 730030,Gansu,China)

机构地区：[1]西北民族大学数学与计算机科学学院,甘肃兰州730030

出　　处：《西北师范大学学报（自然科学版）》2024年第5期120-124,132,共6页Journal of Northwest Normal University(Natural Science)

基　　金：中央高校基本科研业务费项目(31920230173);国家自然科学基金资助项目(12061061);西北民族大学创新团队项目(1110130131)。

摘　　要：图G的无圈边染色是指G的任意两个色类的导出子图不含2-色圈的正常边染色,G的无圈边染色所用最少的颜色数称为G的无圈边色数.证明了两个最大度为2的图的边冠积的无圈边色数等于其最大度.An acyclic edge coloring of a graph G is a proper edge coloring such that the subgraph induced by any two color classes is not bichromatic(2-colored)cycles.The acyclic chromatic index of G is the least number of colors required in an acyclic edge coloring of G.In this paper,it is proved that the acyclic chromatic index of the edge corona product of two graphs of maximum degree 2 is equal to its maximum degree.

关 键 词：边冠积 二部图 无圈边染色 无圈边色数 

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