Edge choosability of planar graphs without short cycles (Q880873)

The author proves that if \(G\) is a planar graph with maximum vertex degree \(\Delta= 5\) and without \(4\)- or \(6\)-cycles, then \(G\) is edge-\(6\)-choosable. It follows that for each \(k\in \{3,4,5,6\}\), a \(k\)-cycle-free planar graph \(G\) is edge-\((\Delta+ 1)\)-choosable.