
Robust Connectivity of Graphs on Surfaces
Let Λ(T) denote the set of leaves in a tree T. One natural problem is to...
read it

Flexible List Colorings in Graphs with Special Degeneracy Conditions
For a given ε > 0, we say that a graph G is ϵflexibly kchoosable if th...
read it

On the cop number of graphs of high girth
We establish a lower bound for the cop number of graphs of high girth in...
read it

Surrounding cops and robbers on graphs of bounded genus
We consider a surrounding variant of cops and robbers on graphs of bound...
read it
Peter Bradshaw
is this you? claim profile