The polynomial method for 3-path extendability of list colourings of planar graphs
Combinatorics
2023-11-23 v2
Abstract
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 3-extendability.
Cite
@article{arxiv.2305.15509,
title = {The polynomial method for 3-path extendability of list colourings of planar graphs},
author = {Przemysław Gordinowicz and Paweł Twardowski},
journal= {arXiv preprint arXiv:2305.15509},
year = {2023}
}