Capture times in the Bridge-burning Cops and Robbers game
Combinatorics
2020-11-21 v1 Discrete Mathematics
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.
Cite
@article{arxiv.2011.00317,
title = {Capture times in the Bridge-burning Cops and Robbers game},
author = {Rebekah Herrman and Peter van Hintum and Stephen G. Z. Smith},
journal= {arXiv preprint arXiv:2011.00317},
year = {2020}
}
Comments
16 pages, 3 figures