Cops, robbers, and burning bridges

24 Dec 2018 Kinnersley William B. Peterson Eric

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 capture a robber on a graph $G$, called the {\em bridge-burning cop number} of $G$ and denoted $c_b(G)$... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS
  • DISCRETE MATHEMATICS