Peter Bradshaw

collaborators

3 papers

math.CO2024

Chip games and multipartite graph paintability

Peter Bradshaw, Tianyue Cao, Atlas Chen +6

We study the paintability, an on-line version of choosability, of complete multipartite graphs. We do this by considering an equivalent chip game introduced by Duraj, Gutowski, and…

math.CO2024

Strong parity edge-colorings of graphs

Peter Bradshaw, Sergey Norin, Douglas B. West

An edge-coloring of a graph $G$ assigns a color to each edge of $G$ . An edge-coloring is a parity edge-coloring if for each path $P$ in $G$ , it uses some color on an odd number of…

math.CO2024

Graphs of maximum average degree less than $\frac{11}{3}$ are flexibly $4$ -choosable

Richard Bi, Peter Bradshaw

We consider the flexible list coloring problem, in which we have a graph $G$ , a color list assignment $L : V (G) \to 2^{N}$ , and a set $U \subseteq V (G)$ of vertices s…

Chip games and multipartite graph paintability

Strong parity edge-colorings of graphs

Graphs of maximum average degree less than 311​ are flexibly 4-choosable

Graphs of maximum average degree less than $\frac{11}{3}$ are flexibly $4$ -choosable