A note on the edge choosability of $K_{5}$-minor free graphs
Jieru Feng, Jianliang Wu, Fan Yang · arXiv (Cornell University) · 2022
For a planar graph $G$, Borodin stated that $G$ is $(Δ+1)$-edge-choosable if $Δ\geq9$ and later Bonamy showed that $G$ is $9$-edge-choosable if $Δ=8$. At the same time, Borodin et al. proved that $G$ is $Δ$-edge-choosable if $Δ\geq12$. In the paper, we extend these results to $K_5$-minor free graphs.