A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Cop-win graphs with maximum capture-time
2010
Discrete Mathematics
We present an upper bound n − 4 for the maximum length of a cop and robber game (the capture-time) on a cop-win graph of order n. This bound matches the known lower bound. We analyze the structure of the class of all graphs attaining this maximum and describe an inductive construction of the entire class. A cop and robber game is a two-player vertex-to-vertex pursuit combinatorial game where the players stand on the vertices of a graph and alternate in moving to adjacent vertices. Cop's goal is
doi:10.1016/j.disc.2010.01.015
fatcat:sj73zkbfijcmtiglugbulnv6ge