13 citations · 21 across the 8 of their papers we have counts for
8 papers
A note on hyperopic cops and robber
Nancy E. Clarke, Stephen Finbow, Margaret-Ellen Messinger +1
We explore a variant of the game of Cops and Robber introduced by Bonato et al.~where the robber is invisible unless outside the common neighbourhood of the cops. The hyperopic cop…
Advances in finding ideal play on poset games
Alexander Clow, Stephen Finbow
Poset games are a class of combinatorial game that remain unsolved. Soltys and Wilson proved that computing wining strategies is in \textbf{PSPACE} and aside from special cases suc…
DP-coloring for planar graphs of diameter two
Jingran Qi, Danjun Huang, Weifan Wang +1
DP-coloring (also known as correspondence coloring) is a generalization of list coloring introduced by Dvourák and Postle (2017). Recently, Huang et al. [https://doi.org/10.1016/j.…
Cops that surround a robber
Andrea C. Burgess, Rosalind A. Cameron, Nancy E. Clarke +4
We introduce the game of Surrounding Cops and Robbers on a graph, as a variant of the original game of Cops and Robbers. In contrast to the original game in which the cops win by o…
-Graphs of Trees
Stephen Finbow, Christopher M. van Bommel
For a graph , the -graph of , denoted , is the graph whose vertex set is the collection of minimum dominating sets, or -sets of , and t…
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…