Variations on cops and robbers
โ
Alan Frieze; Michael Krivelevich; Po-Shen Loh
๐
Article
๐
2011
๐
John Wiley and Sons
๐
English
โ 215 KB
## Abstract We consider several variants of the classical Cops and Robbers game. We treat the version where the robber can move __R__โฅ1 edges at a time, establishing a general upper bound of , where ฮฑ = 1 + 1/__R__, thus generalizing the best known upper bound for the classical case __R__ = 1 due t