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

Showing 2022Show all

4 papers · 1 filter

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…