Edge choosability of planar graphs without small cycles

We investigate structural properties of planar graphs without triangles or without 4-cycles, and show that every triangle-free planar graph G is edge-(Δ(G)+1)-choosable and that every planar graph with Δ(G)≠5 and without 4-cycles is also edge-(Δ(G)+1)-choosable.