A note on k-cop, l-robber games on graphs

We give an algorithmic characterisation of finite cop-win digraphs. The case of k > 1 cops and k l 1 robbers is then reduced to the one cop case. Similar characterisations are also possible in many situations where the movements of the cops and/or the robbers are somehow restricted.

• Type: Journal
• Year: 2006
• Where: DM
• Authors: Gena Hahn, Gary MacGillivray
• Keywords: Algorithmic Characterisation, Cop Case, Cop-win Digraphs, DM 2006