Traversing a graph in general position

Sandi Klavžar, Aditi Krishnakumar, James Tuite +1

Let $G$ be a graph. Assume that to each vertex of a set of vertices $S\subseteq V(G)$ a robot is assigned. At each stage one robot can move to a neighbouring vertex. Then $S$ is a…