We continue the study of token sliding reconfiguration graphs of independent sets initiated
by the authors in an earlier paper (arXiv: 2203.16861). Two of the topics in that paper were …

The independent set reconfiguration problem asks whether one can transform one given
independent set of a graph into another, by changing vertices one by one in such a way the …

This thesis considers two problems under the reconfiguration framework: ARRIVAL and
exhaustive generation of combinatorial objects. Both problems can be viewed in terms of …

Abstract If G=(V, E) is a (finite and simple) graph, we call an independent set X a gated
independent set in G if for each x∈ X, there exists a neighbor y of x such that (X∖{x})∪{y} is …

For a fixed positive integer d≥ 2, a distance-d independent set (DdIS) of a graph is a vertex-
subset whose distance between any two members is at least d. Imagine that there is a token …

The goal of the talk is to give ideas and inspiration to everyone in the audience, whether
currently working in combinatorial reconfiguration or new to the area. Organized as a series …

The Application of Forbidden Structures in Solving Reconfiguration Problems Page 1 The
Application of Forbidden Structures in Solving Reconfiguration Problems Duc A. Hoang Graduate …