3 papers
math.CO2018
Cops, robbers, and burning bridges
William B. Kinnersley, Eric Peterson
We consider a variant of Cops and Robbers wherein each edge traversed by the robber is deleted from the graph. The focus is on determining the minimum number of cops needed to capt…
math.CO2018
Fully Active Cops and Robbers
Ilya Gromovikov, William B. Kinnersley, Ben Seamone
We study a variation of the classical pursuit-evasion game of Cops and Robbers in which agents are required to move to an adjacent vertex on every turn. We explore how the minimum…
math.CO2018
Bounds on the localization number
Anthony Bonato, William B. Kinnersley
We consider the localization game played on graphs, wherein a set of cops attempt to determine the exact location of an invisible robber by exploiting distance probes. The correspo…