| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4647811 | Discrete Mathematics | 2012 | 5 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Nancy E. Clarke, Gary MacGillivray,