Peter Bradshaw

activity

20232026

collaborators

Showing 2023Show all

2 papers · 1 filter

math.CO2023

Flexible list coloring of graphs with maximum average degree less than $3$

Richard Bi, Peter Bradshaw

In the flexible list coloring problem, we consider a graph $G$ and a color list assignment $L$ on $G$ , as well as a subset $U \subseteq V (G)$ for which each $u \in U$ has a preferr…

math.CO2023

Fractional colorings of partial $t$ -trees with no large clique

Peter Bradshaw

Dvořák and Kawarabayashi [European Journal of Combinatorics, 2017] asked, what is the largest chromatic number attainable by a graph of treewidth $t$ with no $K_{r}$ subgraph? In thi…

Flexible list coloring of graphs with maximum average degree less than 3

Fractional colorings of partial t-trees with no large clique

Flexible list coloring of graphs with maximum average degree less than $3$

Fractional colorings of partial $t$ -trees with no large clique