Kempe equivalence of $4$-critical planar graphs

REVIEW

Not yet reviewed by Pith; the record is open.

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 2101.04065 v3 pith:P2GGCVAZ submitted 2021-01-11 math.CO

Carl Feghali This is my paper · ORCID

classification math.CO

keywords criticalkempeplanaransweringclasscoloringsequivalenceevery

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

abstract

Answering a question of Mohar from 2007, we show that for every $4$-critical planar graph, its set of $4$-colorings is a Kempe class.