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, denoted by χ a(G), is the least number of colors such that G has an acyclic edge coloring. A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that χ a(G) ≤Δ(G) + 22, if G is a triangle-free 1-planar graph.
机构:
Department of Computer Science, University of Central Florida, Orlando,FL,32816, United StatesDepartment of Computer Science, University of Central Florida, Orlando,FL,32816, United States
Dutton, Ronald
Journal of Combinatorial Mathematics and Combinatorial Computing,
2019,
111
: 137
-
143