Title of article :
Acyclic list edge coloring of outerplanar graphs
Author/Authors :
Shu، نويسنده , , Qiaojun and Wang، نويسنده , , Yiqiao and Wang، نويسنده , , Weifan، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2013
Abstract :
An 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 Δ .
Keywords :
Acyclic list edge coloring , Outerplanar graphs , maximum degree
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
