A signature-blind inductive proof shows signed planar graphs are 5-choosable and yields corollaries including outerplanar 3-choosability and 1-defective 4-choosability.
Škrekovski,A Grötzsch-type theorem for list colourings with impropriety one, Combin
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Every signed planar graph is $5$-choosable: A short proof and refinements
A signature-blind inductive proof shows signed planar graphs are 5-choosable and yields corollaries including outerplanar 3-choosability and 1-defective 4-choosability.