Carl Feghali

Kempe equivalence of colourings of cubic graphs

Given a graph

A Reconfigurations Analogue of Brooks’ Theorem

G=(V,E)

Recognizing graphs close to bipartite graphs.

and a proper vertex colouring of

Independent feedback vertex sets for graphs of bounded diameter

G

Paths between colourings of sparse graphs

, a Kempe chain is a subset of

Independent Feedback Vertex Set for P_5-free Graphs.

V

Kempe equivalence of colourings of cubic graphs.

that induces a maximal connected subgraph of

A Reconfigurations Analogue of Brooks' Theorem and its Consequences ⋆

G

Independent Feedback Vertex Set for \(P_5\)-Free Graphs

in which every vertex has one of two colours. To make a Kempe change is to obtain one colouring from another by exchanging the colours of vertices in a Kempe chain. Two colourings are Kempe equivalent if each can be obtained from the other by a series of Kempe changes. A conjecture of Mohar asserts that, for

On a conjecture of Mohar concerning Kempe equivalence of regular graphs

k \geq 3