The polynomial method for 3-path extendability of list colourings of planar graphs
- Resource Type
- Working Paper
- Authors
- Gordinowicz, Przemysław; Twardowski, Paweł
- Source
- Subject
- Mathematics - Combinatorics
05C10, 05C15, 05C31
- Language
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.