1 citations · 1 across the 3 of their papers we have counts for
4 papers
An Incidence Result for Well-Spaced Atoms in all Dimensions
Peter Bradshaw
We prove an incidence result counting the -rich -tubes induced by a well-spaced set of -atoms. Our result coincides with the bound that would be heuristically predicted by…
A note on the connected game coloring number
Peter Bradshaw
We consider the \emph{connected game coloring number} of a graph, introduced by Charpentier et al. as a game theoretic graph parameter that measures the degeneracy of a graph with…
On the cop number of graphs of high girth
Peter Bradshaw, Seyyed Aliasghar Hosseini, Bojan Mohar +1
We establish a lower bound for the cop number of graphs of high girth in terms of the minimum degree, and more generally, in terms of a certain growth condition. We show, in partic…
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…