The polynomial method for list-colouring extendability of outerplanar graphs
arXiv:1912.07679
Abstract
We restate theorems of Hutchinson 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.