Name
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 Δ. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.disc.2012.10.005 | Discrete Mathematics |
Keywords | DocType | Volume |
Acyclic list edge coloring,Outerplanar graphs,Maximum degree | Journal | 313 |
Issue | ISSN | Citations |
3 | 0012-365X | 0 |
PageRank | References | Authors |
0.34 | 18 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Qiaojun Shu | 1 | 36 | 4.82 |
| Yiqiao Wang | 2 | 494 | 42.81 |
| Weifan Wang | 3 | 868 | 89.92 |