1 problem

Let $G$ be a graph, and let $G^{1/m}$ denote the graph obtained by replacing each edge of $G$ by a path of length $m$ through new vertices. A graph is locatable if a cop can guaran…