35 citations · 50 across the 16 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DM2015★ 35 cited
The complexity of signed graph and edge-coloured graph homomorphisms
Richard C. Brewster, Florent Foucaud, Pavol Hell +1
We study homomorphism problems of signed graphs from a computational point of view. A signed graph is a graph where each edge is given a sign, positive or negative; $Σ\…
math.CO2015
A Dichotomy Theorem for Circular Colouring Reconfiguration
Richard C. Brewster, Sean McGuinness, Benjamin Moore +1
The "reconfiguration problem" for circular colourings asks, given two -colourings and of a graph , is it possible to transform into by changing the colour…