Acyclic Edge Coloring of IC-planar Graphs.

A proper edge coloring of a graph G is acyclic if there is no 2-colored cycle in G. The acyclic chromatic index of G is the least number of colors such that G has an acyclic edge coloring and denoted by Χ′_a(G). An IC-plane graph is a topological graph where every edge is crossed at most once and no two crossed edges share a vertex. In this paper, it is proved that Χ′_a(G) ≤ Δ(G) + 10, if G is an IC-planar graph without adjacent triangles and Χ′_a(G) ≤ Δ(G) + 8, if G is a triangle-free IC-planar graph. [ABSTRACT FROM AUTHOR]