10 citations · 34 across the 20 of their papers we have counts for
7 papers · 1 filter
Single-conflict colorings of degenerate graphs
Peter Bradshaw, Tomáš Masařík
We consider the single-conflict coloring problem, a graph coloring problem in which each edge of a graph receives a forbidden ordered color pair. The task is to find a vertex color…
Hat guessing number and guaranteed subgraphs
Peter Bradshaw
The hat guessing number of a graph is a parameter related to the hat guessing game for graphs introduced by Winkler. In this paper, we show that graphs of sufficiently large hat gu…
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…
On the hat guessing number of a planar graph class
Peter Bradshaw
The hat guessing number is a graph invariant based on a hat guessing game introduced by Winkler. Using a new vertex decomposition argument involving an edge density theorem of Erdő…
Robust Connectivity of Graphs on Surfaces
Peter Bradshaw, Tomáš Masařík, Jana Novotná +1
Let denote the set of leaves in a tree . One natural problem is to look for a spanning tree of a given graph such that is as large as possible. This proble…
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…