2 citations · 2 across the 8 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017
Hyperopic Cops and Robbers
A. Bonato, N. E. Clarke, D. Cox +3
We introduce a new variant of the game of Cops and Robbers played on graphs, where the robber is invisible unless outside the neighbor set of a cop. The hyperopic cop number is the…
math.CO2017
Disjoint Dominating Sets with a Perfect Matching
William F. Klostermeyer, Margaret-Ellen Messinger, Alejandro Angeli Ayello
In this paper, we consider dominating sets and such that and are disjoint and there exists a perfect matching between them. Let denote the ca…
cs.DM2017★ 2 cited
Limited Visibility Cops and Robbers
N. E. Clarke, D. Cox, C. Duffy +3
We consider a variation of the Cops and Robber game where the cops can only see the robber when the distance between them is at most a fixed parameter . We consider the basic…