Surrounding cops and robbers on graphs of bounded genus

09/22/2019
by   Peter Bradshaw, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset