|
26 Nisan 2019, 10:30 
İstanbul Ayrık Matematik ToplantılarıProblems and Results in Kempe equivalence of colourings Carl Feghali
Let G be a graph with a colouring alpha, and let a and b be two colours.
Then a connected component of the graph induced by vertices coloured a or b is
called a Kempe chain. The operation of swapping the colours of a Kempe chain
is called a Kempe change. Two colourings are Kempe equivalent if they can be
obtained from one another by a sequence of Kempe changes. I will present some
problems and results in this area.
Ayrık Matematik İngilizce IMBM Seminar Room, Bogazici University South Campus Ek Dosya admin 20.03.2020_14:07 |
