1 citations · 1 across the 5 of their papers we have counts for
7 papers · 1 filter
A rainbow connectivity threshold for random graph families
Peter Bradshaw, Bojan Mohar
Given a family of graphs on a common vertex set , we say that is rainbow connected if for every vertex pair , there exists a path from t…
From one to many rainbow Hamiltonian cycles
Peter Bradshaw, Kevin Halasz, Ladislav Stacho
Given a graph and a family of subgraphs of , a transversal of is a pair such that and $ϕ: T \righ…
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…
Transversals and bipancyclicity in bipartite graph families
Peter Bradshaw
A bipartite graph is called bipancyclic if it contains cycles of every even length from four up to the number of vertices in the graph. A theorem of Schmeichel and Mitchem states t…