Kempe Equivalence of Colorings
Bojan Mohar · Birkhäuser Basel eBooks · 2006
Several basic theorems about the chromatic number of graphs can be extended to results in which, in addition to the existence of a κ -coloring, it is also shown that all κ -colorings of the graph in question are Kempe equivalent. Here, it is also proved that for a planar graph with chromatic number less than κ , all κ -colorings are Kempe equivalent.