The Complexity of All $(g,f)$-Factor Problem

Hongliang Lu

Let $G$ be a graph with vertex set $V$ and let $g,f:V\to {\mathbb{Z}}^{+}$ be two functions such that $g\le f$. We say that $G$ has all $(g,f)$-factors if $G$ has an $h$-f…