List-edge-colouring planar graphs with precoloured edges

Joshua Harrelson, Jessica McDonald, Gregory J. Puleo

Let $G$ be a simple planar graph of maximum degree $\Delta$, let $t$ be a positive integer, and let $L$ be an edge list assignment on $G$ with $|L(e)|\ge \Delta +t$ for all $e\in E(G)$. We…