Title of article
Characterizations of -copwin graphs
Author/Authors
Clarke، نويسنده , , Nancy E. and MacGillivray، نويسنده , , Gary، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2012
Pages
5
From page
1421
To page
1425
Abstract
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 .
Keywords
Pursuit game , Cops and robber
Journal title
Discrete Mathematics
Serial Year
2012
Journal title
Discrete Mathematics
Record number
1599935
Link To Document