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

Cops and robbers is a vertex-pursuit game played on graphs. In the classical cops-and-
robbers game, a set of cops and a robber occupy the vertices of the graph and move …

Cops and robber is a two player turn-based game played on a graph where cops try to
capture the robber. The cop number of a graph is the minimum number of cops required to …

Cops and Robbers is a vertex-pursuit game played on graphs. In this game, a set of cops
and a robber occupy the vertices of the graph and move alternately along the graph's edges …

Cops and robber is a two player turn based game played on a graph where the cops try to
catch the robber. The cop number of a graph is the minimum number of cops required to …

Cops and Robber is a two-player pursuit-evasion game played on graphs. Here, one player
controls a set of k cops, and the other player controls a single robber. The game starts with k …

In this paper, we consider one-cop-moves game, in which the cop number of a graph G,
denoted as c1 (G), is the minimum number of cops required to capture a robber on G. We …

The lazy cop number is the minimum number of cops needed for the cops to have a winning
strategy in the game of Cops and Robber where at most one cop may move in any one …

In this thesis, we focus on graph parameters in the game of Cops and Robbers and the
burning number of graphs. The game of cops and robbers is a two-player game played on a …

In this thesis, we focus on graph parameters in the game of Cops and Robbers and the
burning number of graphs. The game of cops and robbers is a two-player game played on a …