The polynomial method for list-colouring extendability of outerplanar graphs

We restate theorems of Hutchinson [5] on list-colouring extendability for outerplanar graphs in terms of non-vanishing monomials in a graph polynomial , which yields an Alon-Tarsi equivalent for her work. This allows to simplify her proofs as well as obtain more general results.