Kempe equivalence in regular graphs

2017-03-24 9:30-10:30 FAMNIT-POŠTA Matthew Johnson (Durham University, England) Kempe equivalence in regular graphs Let G be a graph with a proper vertex colouring. Let a and b be two of the colours. Then a connected component of the subgraph induced…






