The Alon-Tarsi number of a planar graph minus a matching

Jarosław Grytczuk, Xuding Zhu

This paper proves that every planar graph $G$ contains a matching $M$ such that the Alon-Tarsi number of $G-M$ is at most $4$. As a consequence, $G-M$ is $4$-paintable, and hence $…