Related papers: Cops and Robbers on diameter two graphs
Cops and Robbers is a pursuit evasion game played on a graph, first introduced independently by Quilliot \cite{quilliot1978jeux} and Nowakowski and Winkler \cite{NOWAKOWSKI1983235} over four decades ago. A main interest in recent the…
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 alternately along the graph's edges with perfect information about each…
The game of cops and robber is a pursuit-evasion game played on graphs that has been extensively studied. Traditionally the game is played with one or more cops and only one robber, but in this paper we consider the game played with…
In the classic game of Cops and Robbers, a team of cops pursues a robber through a graph. The traditional model of Cops and Robbers operates under the assumption that the cops know the robber's location at all times. Recently, however,…
A generalization of hyperopic cops and robber, analogous to the $k$-visibility cops and robber, is introduced in this paper. For a positive integer $k$ the $k$-hyperopic game of cops and robber is defined similarly as the usual cops and…
The Cops and Robber game on geodesic spaces is a pursuit-evasion game with discrete steps which captures the behavior of the game played on graphs, as well as that of continuous pursuit-evasion games. One of the outstanding open problems…
In the `Covering' pursuit game on a graph, a robber and a set of cops play alternately, with the cops each moving to an adjacent vertex (or not moving) and the robber moving to a vertex at distance at most 2 from his current vertex. The aim…
In the ordinary version of the pursuit-evasion game "cops and robbers", a team of cops and a robber occupy vertices of a graph and alternately move along the graph's edges, with perfect information about each other. If a cop lands on the…
We consider the well-studied cops and robbers game in the context of oriented graphs, which has received surprisingly little attention to date. We examine the relationship between the cop numbers of an oriented graph and its underlying…
We consider a variant of Cops and Robbers wherein each edge traversed by the robber is deleted from the graph. The focus is on determining the minimum number of cops needed to capture a robber on a graph $G$, called the {\em bridge-burning…
The Cops and Robber game is played on undirected finite graphs. $k$ cops and one robber are positioned on vertices and take turn in moving along edges. The cops win if, after a move, a cop and the robber are on the same vertex. A graph is…
This paper is a contribution to the classical cops and robber problem on a graph, directed to two-dimensional grids and toroidal grids. These studies are generally aimed at determining the minimum number of cops needed to capture the robber…
The game of cops and robbers is a pursuit game on graphs where a set of agents, called the cops try to get to the same position of another agent, called the robber. Cops and robbers has been studies on several classes of graphs including…
We prove new theoretical results about several variations of the cop and robber game on graphs. First, we consider a variation of the cop and robber game which is more symmetric called the cop and killer game. We prove for all $c < 1$ that…
In the game of cops and robber, 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 cop number of $G$. The biggest open conjecture in this area…
We investigate a cheating robot version of Cops and Robber, first introduced by Huggan and Nowakowski, where both the cops and the robber move simultaneously, but the robber is allowed to react to the cops' moves. For conciseness, we refer…
We investigate a cops and robber game on directed graphs, where the robber moves along the arcs of the graph, while the cops can select any position at each time step. Our main focus is on the cop number: the minimum number of cops required…
The 'Cheating Robot' version of Cops and Robbers is played on a finite, simple, connected graph. The players move in the same time period. However, before moving, the robot observes to which vertices the cops are moving and it is fast…
We introduce the game of Cops and Eternal Robbers played on graphs, where there are infinitely many robbers that appear sequentially over distinct plays of the game. A positive integer $t$ is fixed, and the cops are required to capture the…
The game of Cops and Robbers on graphs is a well-studied pursuit--evasion model whose central parameter, the cop number, captures the minimum number of pursuers required to guarantee capture of an adversary on a given graph. While the cop…