2 papers
math.CO2025
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Å…
math.CO2025
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…