Wang, Weifan Edge choosability of planar graphs without short cycles. (English) Zbl 1124.05037 Sci. China, Ser. A 48, No. 11, 1531-1544 (2005). 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. Reviewer: Jozef Fiamčik (Prešov) Cited in 3 Documents MSC: 05C15 Coloring of graphs and hypergraphs Keywords:planar graph; chromatic index; edge-\(k\)-choosability PDFBibTeX XMLCite \textit{W. Wang}, Sci. China, Ser. A 48, No. 11, 1531--1544 (2005; Zbl 1124.05037)