10 citations · 34 across the 20 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019★ 4 cited
Surrounding cops and robbers on graphs of bounded genus
Peter Bradshaw, Seyyed Aliasghar Hosseini
We consider a surrounding variant of cops and robbers on graphs of bounded genus. We obtain bounds on the number of cops required to surround a robber on planar graphs, toroidal gr…
math.CO2019★ 10 cited
Cops and robbers on directed and undirected abelian Cayley graphs
Peter Bradshaw, Seyyed Aliasghar Hosseini, Jérémie Turcotte
We show that the cop number of directed and undirected Cayley graphs on abelian groups has an upper bound of the form of , where is the number of vertices, by intr…