The polynomial method for list-colouring extendability of outerplanar graphs
Przemysław Gordinowicz, Paweł Twardowski · Ars Mathematica Contemporanea · 2021
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.