  We restate Thomassen's theorem of 3-extendability, an extension of the famous
planar 5-choosability theorem, in terms of graph polynomials. This yields an
Alon--Tarsi equivalent of 3-extendability.
