Cops and Robbers on Intersection Graphs

Tomáš Gavenčiak, Przemysław Gordinowicz, Vít Jelínek +2

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,…