Cop-win graphs with maximum capture-time

Tomáš Gavenčiak
<span title="">2010</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="" style="color: black;">Discrete Mathematics</a> </i> &nbsp;
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
more &raquo; ... to capture the robber by occupying the same vertex as the robber, robber's goal is to avoid capture.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1016/j.disc.2010.01.015</a> <a target="_blank" rel="external noopener" href="">fatcat:sj73zkbfijcmtiglugbulnv6ge</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> </button> </a>