Add to ORKGCops and Robbers is a turn-based game traditionally played on graphs. Similar to the classic children\u27s game, one cop and one robber move along edges in a graph with the cop trying to catch the robber, and the robber trying to evade capture. In this article, we extend this game to oriented graphs. Although a complete characterization of 1-cop-win graphs is known, there is not yet a corresponding characterization for oriented graphs. Necessary conditions are described for an oriented graph to be 1-cop-win, and several results are provided toward finding sufficient conditions
We investigate the role of the information available to the players on the outcome of the cops and r...
Cops and Robber is a well-studied two-player pursuit-evasion game played on a graph, where a group o...
The problem is to determine the number of ‘cops’ needed to capture a ‘robber’ in a game in which the...
Cops and Robber is a vertex pursuit-evasion game played on graphs. The cops, who always play first, ...
Abstract. In the game of cops and robber, the cops try to capture a robber moving on the vertices of...
In this thesis we study properties of one cop&robber game. In this game two players (Cop and Robber)...
<p>Aigner and Fromme initiated the systematic study of the cop number of a graph by proving the eleg...
Cop Robber game is a two player game played on an undirected graph. In this game cops try to captur...
AbstractLet G be a finite connected graph. Two players, called cop C and robber R, play a game on G ...
DOCTORAL THESIS ABSTRACT Tomáš Gavenčiak Structural and complexity questions of graph theory The ori...
AbstractWe investigate the role of the information available to the players on the outcome of the co...
AbstractA graph G is given and two players, a cop and a robber, play the following game: the cop cho...
International audienceIn the classical cop and robber game, two players, the cop C and the robber R,...
Cop Robber game is a two player game played on an undirected graph. In this game, the cops try to ca...
We consider a game in which a cop searches for a moving robber on a graph using distance probes, whi...
We investigate the role of the information available to the players on the outcome of the cops and r...
Cops and Robber is a well-studied two-player pursuit-evasion game played on a graph, where a group o...
The problem is to determine the number of ‘cops’ needed to capture a ‘robber’ in a game in which the...
Cops and Robber is a vertex pursuit-evasion game played on graphs. The cops, who always play first, ...
Abstract. In the game of cops and robber, the cops try to capture a robber moving on the vertices of...
In this thesis we study properties of one cop&robber game. In this game two players (Cop and Robber)...
<p>Aigner and Fromme initiated the systematic study of the cop number of a graph by proving the eleg...
Cop Robber game is a two player game played on an undirected graph. In this game cops try to captur...
AbstractLet G be a finite connected graph. Two players, called cop C and robber R, play a game on G ...
DOCTORAL THESIS ABSTRACT Tomáš Gavenčiak Structural and complexity questions of graph theory The ori...
AbstractWe investigate the role of the information available to the players on the outcome of the co...
AbstractA graph G is given and two players, a cop and a robber, play the following game: the cop cho...
International audienceIn the classical cop and robber game, two players, the cop C and the robber R,...
Cop Robber game is a two player game played on an undirected graph. In this game, the cops try to ca...
We consider a game in which a cop searches for a moving robber on a graph using distance probes, whi...
We investigate the role of the information available to the players on the outcome of the cops and r...
Cops and Robber is a well-studied two-player pursuit-evasion game played on a graph, where a group o...
The problem is to determine the number of ‘cops’ needed to capture a ‘robber’ in a game in which the...