
Reconfiguring kpath vertex covers
A vertex subset I of a graph G is called a kpath vertex cover if every ...
read it

Shortest Reconfiguration Sequence for Sliding Tokens on Spiders
Suppose that two independent sets I and J of a graph with I = J are ...
read it
Duc A. Hoang
is this you? claim profile