List-edge-coloring of planar graphs without 6-cycles with three chords

A graph G is edge-k-choosable if, whenever we are given a list L(e) of colors with (|L(e)|ge k) for each (ein E(G)), we can choose a color from L(e) for each edge e such that no two adjacent edges receive the same color. In this paper we prove that if G is a planar graph, and each 6-cycle contains at most two chords, then G is edge-k-choosable, where (k=max {8,Delta (G)+1}), and edge-t-choosable, where (t=max {10,Delta (G)}).