The polynomial method for list-colouring extendability of outerplanar graphs
share
We restate theorems of Hutchinson on list-colouring extendability for outerplanar graphs in terms of non-vanishing monomials in a graph polynomial, this way obtaining Alon-Tarsi equivalent for her work. This allows to simplify the proofs as well as obtain more general results.
READ FULL TEXT