Kempe equivalence of $4$-critical planar graphs
Combinatorics
2022-07-05 v3
Abstract
Answering a question of Mohar from 2007, we show that for every -critical planar graph, its set of -colorings is a Kempe class.
Cite
@article{arxiv.2101.04065,
title = {Kempe equivalence of $4$-critical planar graphs},
author = {Carl Feghali},
journal= {arXiv preprint arXiv:2101.04065},
year = {2022}
}
Comments
10 pages, 3 figures; incorporated referees' suggestions