Cops and Robbers on Intersection Graphs

The game of cops and robber, introduced by Nowakowski and Winkler in 1983, is played by two players on a graph G, one controlling k cops and the other one robber, all positioned on V G . The players alternate in moving their pieces to distance at most 1 each. The cops win if they capture the robber, the robber wins by escaping indefinitely. The cop-number of G, that is the smallest k such that k cops win the game, has recently been a widely studied parameter.