35 citations · 50 across the 16 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2023
List homomorphisms to separable signed graphs
Jan Bok, Richard Brewster, Tomás Feder +2
The complexity of the list homomorphism problem for signed graphs appears difficult to classify. Existing results focus on special classes of signed graphs, such as trees and refle…
cs.DM2018★ 1 cited
On the multipacking number of grid graphs
Laurent Beaudou, Richard C. Brewster
In 2001, Erwin introduced broadcast domination in graphs. It is a variant of classical domination where selected vertices may have different domination powers. The minimum cost of…
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; $Σ\…