The polynomial method for list-colouring extendability of outerplanar graphs

DOI10.26493/1855-3974.2398.7d5zbMath1479.05104arXiv1912.07679OpenAlexW3187571705MaRDI QIDQ5020296

Przemysław Gordinowicz, Paweł Twardowski

Publication date: 5 January 2022

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.07679

zbMATH Keywords

outerplanar graphlist colouringpaintabilityAlon-Tarsi number

Mathematics Subject Classification ID

Graph polynomials (05C31) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Colorings and orientations of graphs
• Every planar graph is 5-choosable
• The Alon-Tarsi number of planar graphs
• Five-list-coloring graphs on surfaces. III: One list of size one and one list of size two
• The Alon-Tarsi number of a planar graph minus a matching
• Five-list-coloring graphs on surfaces. I. Two lists of size two in planar graphs
• Mr. Paint and Mrs. Correct
• On list-coloring extendable outerplanar graphs
• Combinatorial Nullstellensatz

This page was built for publication: The polynomial method for list-colouring extendability of outerplanar graphs