R. Brewster

activity

20142024

most citedThe complexity of signed graph and edge-coloured graph homomorphisms

35 citations · 50 across the 16 of their papers we have counts for

collaborators

Showing 2020Show all

2 papers · 1 filter

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★ 4 cited

List homomorphism problems for signed trees

Jan Bok, Richard Brewster, Tomás Feder +2

We consider homomorphisms of signed graphs from a computational perspective. In particular, we study the list homomorphism problem seeking a homomorphism of an input signed graph $…

Characterizing Circular Colouring Mixing for qp​<4

List homomorphism problems for signed trees

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