The acyclic chromatic index of planar graphs without 4-,6-cycles and intersecting triangles  

作　　者：Yuehua BU Qi JIA Hongguo ZHU 

机构地区：[1]College of Mathematics and Computer Science,Zhejiang Normal University,Jinhua 321004,China [2]Xingzhi College,Zhejiang Normal University,Jinhua 321004,China

出　　处：《Frontiers of Mathematics in China》2024年第3期117-136,共20页中国高等学校学术文摘·数学（英文）

摘　　要：A proper edge k-coloring is a mappingΦ:E(G)-→{1,2,...,k}such that any two adjacent edges receive different colors.A proper edge k-coloringΦof G is called acyclic if there are no bichromatic cycles in G.The acyclic chromatic index of G,denoted by Xa(G),is the smallest integer k such that G is acyclically edge k-colorable.In this paper,we show that if G is a plane graph without 4-,6-cycles and intersecting 3-cycles,△(G)≥9,then Xa(G)≤△(G)+1.

关 键 词：Acyclic edge coloring plane graph CYCLE 

分 类 号：O15[理学—数学]