1. Acyclic list edge coloring of outerplanar graphs
- Author
-
Qiaojun Shu, Yiqiao Wang, and Weifan Wang
- Subjects
Discrete mathematics ,List edge-coloring ,Maximum degree ,Outerplanar graphs ,ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION ,Complete coloring ,Brooks' theorem ,Theoretical Computer Science ,Greedy coloring ,Combinatorics ,Edge coloring ,Acyclic list edge coloring ,Discrete Mathematics and Combinatorics ,Graph coloring ,Fractional coloring ,List coloring ,Mathematics ,MathematicsofComputing_DISCRETEMATHEMATICS - 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 Δ .
- Full Text
- View/download PDF