The polynomial method for list-colouring extendability of outerplanar graphs
Combinatorics
2020-08-11 v2 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.1912.07679,
title = {The polynomial method for list-colouring extendability of outerplanar graphs},
author = {Przemysław Gordinowicz and Paweł Twardowski},
journal= {arXiv preprint arXiv:1912.07679},
year = {2020}
}