Year: 2019
Type: preprint
Abstract: 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.
Source: arXiv (Cornell University)
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2974041559