4 research outputs found
Acyclic list edge coloring of outerplanar graphs
AbstractAn acyclic list edge coloring of a graph G is a proper list edge coloring such that no bichromatic cycles are produced. In this paper, we prove that an outerplanar graph G with maximum degree Δ≥5 has the acyclic list edge chromatic number equal to Δ