Kempe equivalence of 4-critical planar graphs

2021/01/11 by Feghali, Carl
#05C15 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2101.04065

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.

Related

• Some New Methods for Constructing 4-critical Planar Graphs
• Kempe equivalence of edge-colourings in subcubic and subquartic graphs
• Kempe equivalence of 4-colourings of some plane triangulations
• Kempe changes in H-free graphs
• On a conjecture of Mohar concerning Kempe equivalence of regular graphs