ACYCLIC LIST EDGE COLORING OF PLANAR GRAPHS

A proper edge coloring of a graph is said to be acyclic if any cycle is colored with at least three colors. The acyclic chromatic index, denoted a ′ (G), is the least number of colors required for an acyclic edge coloring of G. An edge-list L of a graph G is a mapping that assigns a finite set of positive integers to each edge