Pith. sign in

REVIEW 1 cited by

Weak degeneracy of planar graphs and locally planar graphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2303.07901 v1 pith:N452RVRC submitted 2023-03-14 math.CO

Ming Han , Tao Wang , Jianglin Wu , Huan Zhou , Xuding Zhu This is my paper · ORCID
classification math.CO
keywords graphsplanardegeneracydegeneratelocallyweaklychoosablecoloring
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Weak degeneracy is a variation of degeneracy which shares many nice properties of degeneracy. In particular, if a graph $G$ is weakly $d$-degenerate, then for any $(d + 1)$-list assignment $L$ of $G$, one can construct an $L$-coloring of $G$ by a modified greedy coloring algorithm. It is known that planar graphs of girth 5 are 3-choosable and locally planar graphs are 5-choosable. This paper strengthens these results and proves that planar graphs of girth 5 are weakly 2-degenerate and locally planar graphs are weakly 4-degenerate.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Local Weak Degeneracy of Planar Graphs

    math.CO 2025-04 accept novelty 8.0 of 10

    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.

Pith tools