İstanbul Discrete Mathematics Meetings

Problems and Results in Kempe equivalence of colourings
Carl Feghali
University of Bergen, Norway
Özet : 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.
  Tarih : 26.04.2019
  Saat : 10:30
  Yer : IMBM Seminar Room, Bogazici University South Campus
  Dil : English
  Ek Dosya : Özet
    Yazdır