Characterizations of kk-copwin graphs

We give two characterizations of the graphs on which kk 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=1k=1.