Peter Bradshaw

activity

20232026

collaborators

Showing 2026Show all

3 papers · 1 filter

math.CO2026

Density of list- and correspondence-critical graphs

Peter Bradshaw

A graph $G$ is list $k$ -critical if $G$ is not $(k - 1)$ -list-colorable, but every proper subgraph of $G$ is $(k - 1)$ -list-colorable. In this paper, we study the function $f_{\ell}(n,…

math.CO2026

DP vertex-arboricity of sparse graphs

Peter Bradshaw, Alexandr Kostochka, Zimu Xiang

The vertex arboricity $va (G)$ of a multigraph $G$ is the minimum number $k$ for which $V (G)$ can be partitioned into $k$ subsets, each of which induces an acyclic subgraph…

math.CO2026

The strong chromatic index of $K_{t, t}$ -free graphs

Richard Bi, Peter Bradshaw, Abhishek Dhawan +1

A strong edge coloring of a graph $G$ is an edge coloring $ϕ : E (G) \to N$ such that each color class forms an induced matching in $G$ . The strong chromatic index…

Density of list- and correspondence-critical graphs

DP vertex-arboricity of sparse graphs

The strong chromatic index of Kt,t​-free graphs

The strong chromatic index of $K_{t, t}$ -free graphs