32 citations · 117 across the 58 of their papers we have counts for
5 papers · 2 filters
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…
Topological directions in Cops and Robbers
Anthony Bonato, Bojan Mohar
We survey results at the intersection of topological graph theory and the game of Cops and Robbers, focusing on results, conjectures, and open problems for the cop number of a grap…
Bounds on the burning numbers of spiders and path-forests
Anthony Bonato, Thomas Lidbetter
Graph burning is one model for the spread of memes and contagion in social networks. The corresponding graph parameter is the burning number of a graph , written , which m…
Common adversaries form alliances: modelling complex networks via anti-transitivity
Anthony Bonato, Ewa Infeld, Hari Pokhrel +1
Anti-transitivity captures the notion that enemies of enemies are friends, and arises naturally in the study of adversaries in social networks and in the study of conflicting natio…
Characterizations and algorithms for generalized Cops and Robbers games
Anthony Bonato, Gary MacGillivray
We propose a definition of generalized Cops and Robbers games where there are two players, the Pursuer and the Evader, who each move via prescribed rules. If the Pursuer can ensure…