Graph Searching Games and Probabilistic Methods is the first book that focuses on the
intersection of graph searching games and probabilistic methods. The book explores …

Pursuit-evasion games have been intensively studied for several decades due to their
numerous applications in artificial intelligence, robot motion planning, database theory …

We determine the cop number of the hypercube for different versions of the game Cops and
Robber. Cops and Robber is a two player game played on an undirected graph. One player …

Aigner and Fromme initiated the systematic study of the cop number of a graph by proving
the elegant and sharp result that in every connected planar graph, three cops are sufficient …

\textit {Pursuit-evasion games} have been intensively studied for several decades due to
their numerous applications in artificial intelligence, robot motion planning, database theory …

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 …

Cops and Robber is a well-studied two-player pursuit-evasion game played on a graph,
where a group of cops tries to capture the robber. The cop number of a graph is the …

We study zombies and survivor, a variant of the game of cops and robber on graphs. In this
variant, the single survivor plays the role of the robber and attempts to escape from the …

In the game of cops and robbers, the cops try to capture a robber moving on the vertices of
the graph. The minimum number of cops required to win on a given graph $ G $ is called the …

We study versions of cop and robber pursuit–evasion games on the visibility graphs of
polygons, and inside polygons with straight and curved sides. Each player has full …