• Corpus ID: 202719591

Surrounding cops and robbers on graphs of bounded genus

  title={Surrounding cops and robbers on graphs of bounded genus},
  author={Peter Bradshaw and Seyyed Aliasghar Hosseini},
  journal={arXiv: Combinatorics},
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. 

Figures from this paper

Cops that surround a robber

C O ] 3 1 O ct 2 01 9 Cops that Surround a Robber

We introduce the game of Surrounding Cops and Robber on a graph, as a variant of the traditional game of Cops and Robber. In contrast to the traditional game in which the cops win by occupying the

Simultaneous Moves with Cops and an Insightful Robber

In graphs where retracts are involved, it is shown how cop strategies against a robber can be modified to capture a robot, which gives exact numbers for hypercubes, and $k$-dimensional grids in general.



Guarding isometric subgraphs and Lazy Cops and Robbers

In the game of Cops and Robbers, one of the most useful results is that an isometric path in a graph can be guarded by one cop. In this paper, we introduce the concept of wide shadow on a graph, and

The Copnumber of a Graph is Bounded by [3/2 genus ( G )] + 3

We prove that the copnumber of a finite connected graph of genus g is bounded by [3/2g]+3. In particular this means that the copnumber of a toroidal graph is bounded by 4. We also sketch a proof that

On Meyniel's conjecture of the cop number

This article proves Meyniel's conjecture in special cases that G has diameter 2 or G is a bipartite graph of diameter 3, improving the best previously known upper-bound O(n/ lnn) due to Chiniforooshan.

On the cop number of toroidal graphs

A game of cops and robbers

A Bound for the Cops and Robbers Problem

Improving several previous results, it is proved that the cop number of an n-vertex graph is at most n2 −ð1 þoð1ÞÞ ffiffiffiffIFFiffiffiffsiffiffi log n p .

A new bound for the cops and robbers problem

In this short paper we study the game of cops and robbers, which is played on the vertices of some fixed graph $G$. Cops and a robber are allowed to move along the edges of $G$ and the goal of cops

The robber strikes back

The minimum number of cops needed to capture a robber on a graph G, written cc(G), is studied and bounds are given in terms of the cop number of G in the classes of bipartite graphs and diameter two, K 1, m -free graphs.

Variations of cops and robber on the hypercube

The cop number of the hypercube is determined for different versions of the game Cops and Robber, a two player game played on an undirected graph, and a third kind of cop is introduced, a passive cop, which must remain still on a turn.

Cops that surround a robber