2000 character limit reached
Capture times in the Bridge-burning Cops and Robbers game
Published 31 Oct 2020 in math.CO and cs.DM | (2011.00317v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.