Edge choosability of planar graphs without short cycles

摘要

In this paper we prove that if G is a planar graph with △ = 5 and without 4-cycles or 6-cycles, then G is edge-6-choosable. This consequence together with known (△ + 1)-choosable, where△ denotes the maximum degree of G.