A note on kernel-perfect orientations and DP-colorings from derangement assignments

We prove a generalization of the well-known Bondy-Bopanna-Siegel Lemma to DP-colorings from a class of correspondence assignments which we call derangement assignments. Since DP-colorings from derangement assignments generalize zero-free list colorings of signed graphs, this yields an orientation theorem for zero-free signed list colorings, as well.