  Let $G$ be a graph and let $g$, $f$, and $f'$ be three positive
integer-valued functions on $V(G)$ with $g\le f$. Tokuda, Xu, and Wang (2003)
showed that if $G$ contains a $(g,f)$-factor and a spanning $f'$-tree, then $G$
also contains a connected $(g,f+f'-1)$-factor. In this note, we develop their
result to a tree-connected version by proving that if $G$ contains a
$(g,f)$-factor and an $m$-tree-connected $(m,f')$-factor, then $G$ also
contains an $m$-tree-connected $(g,f+f'-m)$-factor, provided that $f\ge m$. In
addition, we show that $g$ allows to be nonnegative.
