2000 character limit reached
The polynomial method for list-colouring extendability of outerplanar graphs (1912.07679v2)
Published 16 Dec 2019 in math.CO and cs.DM
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.