Edge-choosability of planar graphs without chordal 6-Cycles

A graph G is edge-L-colorable, if for a given edge assignment L = {L(e) : e is an element of E(G)}, there exits a proper edge-coloring phi of G such that phi(e) is an element of L(e) for all e is an element of E(G). If G is edge-L-colorable for every edge assignment L with vertical bar L(e)vertical bar >= k for e is an element of E(G), then G is said to be edge-k-choosable. In this paper, we prove that if G is a planar graph without chordal 6-cycles, then G is edge-k-choosable, where k = max{8, Delta(G) + 1}.