Acyclic list edge coloring of outerplanar graphs

An acyclic list edge coloring of a graph GG is a proper list edge coloring such that no bichromatic cycles are produced. In this paper, we prove that an outerplanar graph GG with maximum degree Δ≥5Δ≥5 has the acyclic list edge chromatic number equal to ΔΔ.