List-avoiding orientations

Peter Bradshaw, Yaobin Chen, Hao Ma +2

Given a graph $G$ with a set $F(v)$ of forbidden values at each $v\in V(G)$, an $F$-avoiding orientation of $G$ is an orientation in which $de{g}^{+}(v)\notin F(v)$ for each vertex…