A characterization on orientations of graphs avoiding given lists on out-degrees

Xinxin Ma, Hongliang Lu

Let $G$ be a graph and $F:V(G)\to 2^N$ be a set function. The graph $G$ is said to be \emph{F-avoiding} if there exists an orientation $O$ of $G$ such that $d_O^{+}(v)\notin F(v)$ for…