A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
A relational characterization of cop-win graphs was provided by Nowakowski and Winkler in their seminal paper on the game of Cops and Robbers. As a by-product of that characterization, each cop-win graph is assigned a unique ordinal, which we refer to as a CR-ordinal. For finite graphs, CR-ordinals correspond to the length of the game assuming optimal play, with the cop beginning the game in a least favourable initial position. For infinite graphs, however, the possible values of CR-ordinalsarXiv:1603.04266v2 fatcat:6fbg6bjx6nhkfdko4xephefn7e