Acyclic Edge Coloring of Planar Graphs without Adjacent Triangles  

作　　者：DezhengXIE YanqingWU 

机构地区：[1]CollegeofMathematicsandStatistics,ChongqingUniversity,Chongqing401331,P.R.China [2]SchoolofMathematicsandComputerScience,ShanxiNormalUniversity,Shanxi041000,P.R.China

出　　处：《Journal of Mathematical Research with Applications》2012年第4期407-414,共8页数学研究及应用（英文版）

摘　　要：An acyclic edge coloring of a graph G is a proper edge coloring such that there are no bichromatic cycles.The acyclic edge chromatic number of a graph G is the minimum number k such that there exists an acyclic edge coloring using k colors and is denoted by χ’ a（G）.In this paper we prove that χ ’ a（G） ≤（G） ＋ 5 for planar graphs G without adjacent triangles.An acyclic edge coloring of a graph G is a proper edge coloring such that there are no bichromatic cycles.The acyclic edge chromatic number of a graph G is the minimum number k such that there exists an acyclic edge coloring using k colors and is denoted by χ’ a（G）.In this paper we prove that χ ’ a（G） ≤（G） ＋ 5 for planar graphs G without adjacent triangles.

关 键 词：acyclic edge coloring acyclic edge chromatic number planar graph. 

分 类 号：O157.5[理学—数学] O123.1[理学—基础数学]