Przemysław Gordinowicz, Paweł Twardowski
Published 2019-12-16Version 1
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.
The polynomial method for 3-path extendability of list colourings of planar graphs
The ratio of the numbers of odd and even cycles in outerplanar graphs
Outerspatial 2-complexes: Extending the class of outerplanar graphs to three dimensions
![QR code for arXiv:1912.07679 [math.CO]](http://oss.arxitics.com/images/favicon.svg)