6 papers
Localization game capture time of trees and outerplanar graphs
Vesna IrÅ¡iÄ Chenoweth, Matija Skrt
The localization game is a variant of the game of Cops and Robber in which the robber is invisible and moves between adjacent vertices, but the cops can probe any vertices of t…
Cop number of partial cubes
Nicholas Crawford, Vesna IrÅ¡iÄ Chenoweth
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 guarant…
The capture time in the game of cops and many robbers
Miha Gyergyek, Vesna IrÅ¡iÄ Chenoweth
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…
Complexity of the game connected domination problem
Vesna IrÅ¡iÄ Chenoweth
The connected domination game is a variation of the domination game where the played vertices must form a connected subgraph at all stages of the game. In this paper we prove that…
The radius capture number
Tanja Dravec, Vesna IrÅ¡iÄ Chenoweth, Andrej Taranenko
In the classic cop and robber game, two players--the cop and the robber--take turns moving to a neighboring vertex or staying at their current position. The cop aims to capture the…
-Hyperopic Cops and Robber
Nicholas Crawford, Vesna IrÅ¡iÄ Chenoweth
A generalization of hyperopic cops and robber, analogous to the -visibility cops and robber, is introduced in this paper. For a positive integer the -hyperopic game of co…