  We make several advances towards a structural characterisation of the signed
graphs $H$ for which the list signed $H$-colouring problem is polynomial time
solvable. We suggest a possible characterisation in the case that $H$ is
irreflexive.
