The polynomial method for 3-path extendability of list colourings of planar graphs
From MaRDI portal
Publication:6437869
arXiv2305.15509MaRDI QIDQ6437869FDOQ6437869
Authors: Przemysław Gordinowicz, Paweł Twardowski 
Publication date: 24 May 2023
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.
Graph polynomials (05C31) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
This page was built for publication: The polynomial method for 3-path extendability of list colourings of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6437869)
