Results 1 
2 of
2
Characterizations of kcopwin graphs
, 2009
"... a b s t r a c t We give two characterizations of the graphs on which k cops have a winning strategy in the game of Cops and Robber. One of these is in terms of an order relation, and one is in terms of a vertex ordering. Both generalize characterizations known for the case k = 1. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
a b s t r a c t We give two characterizations of the graphs on which k cops have a winning strategy in the game of Cops and Robber. One of these is in terms of an order relation, and one is in terms of a vertex ordering. Both generalize characterizations known for the case k = 1.