The robber strikes back

Anthony Bonato (1) , Stephen Finbow (2) , Przemyslaw Gordinowicz (3) , Ali Haidar (4) , William B. Kinnersley (1) , Dieter Mitsche (5) , Pawel Pralat (6) , Ladislav Stacho (7)

1 Ryerson University [Toronto]
2 St. Francis Xavier
3 Łódź University of Technology
4 Carleton University
5 LJAD - Laboratoire Jean Alexandre Dieudonné
6 Department of Mathematics
7 SFU - Department of Mathematics [Burnaby]

We consider the new game of Cops and Attacking Robbers, which is identical to the usual Cops and Robbers game except that if the robber moves to a vertex containing a single cop, then that cop is removed from the game. We study the minimum number of cops needed to capture a robber on a graph G, written cc(G). We give bounds on cc(G) in terms of the cop number of G in the classes of bipartite graphs and diameter two, K_1,m-free graphs.

Domaines: Mathématique discrète [cs.DM]

Anthony Bonato, Stephen Finbow, Przemyslaw Gordinowicz, Ali Haidar, William B. Kinnersley, et al.. The robber strikes back. ICC3, Dec 2013, Coimbatore, India. ⟨hal-00923120⟩