Kempe equivalence of colourings of cubic graphs
(2015)
Conference Proceeding
Feghali, C., Johnson, M., & Paulusma, D. (2015). Kempe equivalence of colourings of cubic graphs. . https://doi.org/10.1016/j.endm.2015.06.034
Given a graph G = (V,E) and a proper vertex colouring of G, a Kempe chain is a subset of V that induces a maximal connected subgraph of G in which every vertex has one of two colours. To make a Kempe change is to obtain one colouring from another by... Read More about Kempe equivalence of colourings of cubic graphs.