Kempe equivalence of 4-critical planar graphs
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.