The Robber Strikes Back [chapter]

Anthony Bonato, Stephen Finbow, Przemysław Gordinowicz, Ali Haidar, William B. Kinnersley, Dieter Mitsche, Paweł Prałat, Ladislav Stacho
<span title="2013-11-27">2013</span> <i title="Springer India"> <a target="_blank" rel="noopener" href="" style="color: black;">Advances in Intelligent Systems and Computing</a> </i> &nbsp;
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, K1,m-free graphs.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1007/978-81-322-1680-3_1</a> <a target="_blank" rel="external noopener" href="">fatcat:lqyeq446gjffjf3d5vxbmwnofe</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> </button> </a>