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 for each , 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 , and edge-t-choosable, where .