We continue the study of token sliding reconfiguration graphs of indepen...
For a fixed positive integer d ≥ 2, a distance-d independent set
(DdIS) ...
An independent set of a graph G is a vertex subset I such that there is
...
A k-path vertex cover (k-PVC) of a graph G is a vertex subset I such
tha...
A vertex subset I of a graph G is called a k-path vertex cover if every
...
Suppose that two independent sets I and J of a graph with I
= J are ...