An extension of Tutte's 1-factor theorem

We prove the following theorem: Let G be a graph with vertex-set V and ?, g be two integer-valued functions defined on V such that $\text{0}\text{?g(x) ?1??(x)}$ for all x ∈ V. Then G contains a factor F such that $\text{g(x)?d}{}_{\mathrm{F}}\text{(x)??(x)}$ for all x ∈ V if and only if for every subset X of V, $\text{?(X)}$ is at least equal to the number of connected components C of GV ? X] such that either C = {x} and g(x) = 1, or |C| is odd ?3 and $\text{g(x) = ?(x) =}\text{1}$ for all x ∈ C. Applications are given to certain combinatorial geometries associated with factors of graphs.