| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4647618 | Discrete Mathematics | 2013 | 11 Pages |
Abstract
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 ΔΔ.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Qiaojun Shu, Yiqiao Wang, Weifan Wang,