B. Moore

activity

20172023

most citedGraph Homomorphism Reconfiguration and Frozen

H

-Colourings

4 citations · 9 across the 13 of their papers we have counts for

collaborators

Showing 2020 · math.COShow all

2 papers · 2 filters

math.CO2020

Characterizing Circular Colouring Mixing for $\frac{p}{q} < 4$

Richard C. Brewster, Benjamin Moore

Given a graph $G$ , the $k$ -mixing problem asks: Can one obtain all $k$ -colourings of $G$ , starting from one $k$ -colouring $f$ , by changing the colour of only one vertex at a time,…

math.CO2020

Sparse $4$ -critical graphs have low circular chromatic number

Benjamin Moore

Kostochka and Yancey proved that every $4$ -critical graph $G$ has $e (G) \geq \frac{5 v ( G ) - 2}{3}$ , and that equality holds if and only if $G$ is $4$ -Ore. We show that a question of…

Characterizing Circular Colouring Mixing for qp​<4

Sparse 4-critical graphs have low circular chromatic number

Characterizing Circular Colouring Mixing for $\frac{p}{q} < 4$

Sparse $4$ -critical graphs have low circular chromatic number