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
We investigate extremal graphs related to the game of Cops and Robbers. We focus on graphs where a single cop can catch the robber; such graphs are called cop-win. The capture time of a cop-win graph is the minimum number of moves the cop needs to capture the robber. We consider graphs that are extremal with respect to capture time, i.e. their capture time is as large as possible given their order. We give a new characterization of the set of extremal graphs. For our alternative approach wearXiv:1703.04427v3 fatcat:ojabpfcjpjcddhogw7wt6nwlky