Peter Bradshaw

activity

20192023

most citedCops and robbers on directed and undirected abelian Cayley graphs

10 citations · 34 across the 20 of their papers we have counts for

collaborators

21 papers

math.CO2023

Injective edge colorings of degenerate graphs and the oriented chromatic number

Peter Bradshaw, Alexander Clow, Jingwei Xu

Given a graph $G$ , an injective edge-coloring of $G$ is a function $ψ : E (G) \to N$ such that if $ψ (e) = ψ (e^{'})$ , then no third edge joins an endpoint of $e$ and an en…

math.CO2022★ 2 cited

List-avoiding orientations

Peter Bradshaw, Yaobin Chen, Hao Ma +2

Given a graph $G$ with a set $F (v)$ of forbidden values at each $v \in V (G)$ , an $F$ -avoiding orientation of $G$ is an orientation in which $d e g^{+} (v) \neq \in F (v)$ for each vertex…

math.CO2022

Hamiltonicity of covering graphs of trees

Peter Bradshaw, Zhilin Ge, Ladislav Stacho

In this paper, we consider covering graphs obtained by lifting a tree with a loop at each vertex as a voltage graph over a cyclic group. We generalize a tool of Hell, Nishiyama, an…

math.CO2022

Separating the online and offline DP-chromatic numbers

Peter Bradshaw

The DP-coloring problem is a generalization of the list-coloring problem in which the goal is to find an independent transversal in a certain topological cover of a graph $G$ . In t…

math.CO2022

Cooperative colorings of forests

Peter Bradshaw

Given a family $G$ of graphs spanning a common vertex $V$ , a cooperative coloring of $G$ is a collection of one independent set from each graph of $G$ su…

math.CO2021

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…