Reconfiguration is concerned with relationships among solutions to a problem instance,
where the reconfiguration of one solution to another is a sequence of steps such that each …

We show that several reconfiguration problems known to be PSPACE-complete remain so
even when limited to graphs of bounded bandwidth (and hence pathwidth and treewidth) …

We present the first results on the parameterized complexity of reconfiguration problems,
where a reconfiguration variant of an optimization problem QQ takes as input two feasible …

In graph theory, reconfiguration is concerned with relationships among solutions to a given
problem for a specific graph. The reconfiguration of one solution into another occurs via a …

Given a Boolean formula and a satisfying assignment, a flip is an operation that changes the
value of a variable in the assignment so that the resulting assignment remains satisfying. We …

Let G be a graph with a vertex colouring α. Let a and b be two colours. Then a connected
component of the subgraph induced by those vertices coloured either a or b is known as a …

The k k-colouring reconfiguration problem asks whether, for a given graph GG, two proper k
k-colourings α α and β β of GG, and a positive integer ℓ ℓ, there exists a sequence of at most …

A vertex-subset graph problem Q defines which subsets of the vertices of an input graph are
feasible solutions. A reconfiguration variant of a vertex-subset problem asks, given two …

For a fixed graph H, we consider the H-Recoloring problem: given a graph G and two H-
colorings of G, ie, homomorphisms from G to H, can one be transformed into the other by …

In this paper, we show that for every graph of maximum average degree bounded away from
d and any two (d+ 1)-colorings of it, one can transform one coloring into the other one within …