Showing math.COShow all
2 papers · 1 filter
math.CO2023
The polynomial method for 3-path extendability of list colourings of planar graphs
Przemysław Gordinowicz, Paweł Twardowski
We restate Thomassen's theorem of 3-extendability, an extension of the famous planar 5-choosability theorem, in terms of graph polynomials. This yields an Alon--Tarsi equivalent of…
math.CO2019
The polynomial method for list-colouring extendability of outerplanar graphs
Przemysław Gordinowicz, Paweł Twardowski
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 equiv…