2 citations · 4 across the 3 of their papers we have counts for
3 papers
math.CO2020★ 1 cited
The watchman's walk problem on directed graphs
Danny Dyer, Jared Howell, Brittany Pittman
In a graph, a watchman's walk is a minimum closed dominating walk. Given a graph and a single watchman, the length of a watchman's walk in (the watchman number) is denoted…
math.CO2020★ 1 cited
A note on watchman's walks in de Bruijn graphs
Danny Dyer, Jared Howell, Brittany Pittman
The watchman's walk problem in a digraph calls for finding a minimum length closed dominating walk, where direction of arcs is respected. The watchman's walk of a de Bruijn graph o…
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…