Capture times in the Bridge-burning Cops and Robbers game
arXiv:2011.00317
Abstract
In this paper, we consider a variant of the cops and robbers game on a graph, introduced by Kinnersley and Peterson, in which every time the robber uses an edge, it is removed from the graph, known as bridge-burning cops and robbers. In particular, we study the maximum time it takes the cops to capture the robber.
16 pages, 3 figures