Every planar graph is weakly degenerate with list sizes f(v) ≥ max{7-g(v),2}, proving the correspondence-colouring analogue of local-girth choosability.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Local Weak Degeneracy of Planar Graphs
Every planar graph is weakly degenerate with list sizes f(v) ≥ max{7-g(v),2}, proving the correspondence-colouring analogue of local-girth choosability.