A complexity dichotomy for signed H-colouring

Verifying a conjecture of Brewster, Foucaud, Hell and Naserasr, we show that signed (H,Π)-colouring is NP-complete for any signed graph (H,Π) whose s-core has at least 3 edges.