  We consider a surrounding variant of cops and robbers on graphs of bounded
genus. We obtain bounds on the number of cops required to surround a robber on
planar graphs, toroidal graphs, and outerplanar graphs. We also obtain improved
bounds for bipartite planar and toroidal graphs. We briefly consider general
graphs of bounded genus and graphs with a forbidden minor.
