Acyclic edge coloring of planar graphs without adjacent cycles

• 作 者: wan Min XU BaoGang
• 机 构: InstituteofMathematics,!DepartmentofMathematics
• 出 处: 中国科学：数学英文版
• 发表日期: 2014年2期
• 关键词: 边染色 平面图 周期 无圈边色数 最小数 最大度 无环 acyclic edge coloring planar graph adjacent cycles
• 基金项目: This work was supported by National Natural Science Foundation of China （Grant Nos. 10931003 and 11171160） and by Doctoral Fund of Ministry of Education of China （Grant No. 10871011）.

A proper edge coloring of a graph G is said to be acyclic if there is no bicolored cycle in G.The acyclic edge chromatic number of G,denoted byχ′a(G),is the smallest number of colors in an acyclic edge coloring of G.Let G be a planar graph with maximum de