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
The cop number of a graph G is the smallest k such that k cops win the game of cops and robber on G. We investigate the maximum cop number of geometric intersection graphs, which are graphs whose vertices are represented by geometric shapes and edges by their intersections. We establish the following dichotomy for previously studied classes of intersection graphs: The intersection graphs of arc-connected sets in the plane (called string graphs) have cop number at most 15, and more generally,arXiv:1607.08058v1 fatcat:yyeeioogmbde5hjqtd2tb7proy