Article ID Journal Published Year Pages File Type
4650624 Discrete Mathematics 2006 6 Pages PDF
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A note on k-cop, l-robber games on graphs
Authors
, ,