  In this paper, we show that every $2m$-partition-connected graph $G$ has a
bipartite $m$-partition-connected factor $H$ such that for each vertex $v$,
$d_H(v)\le \lceil \frac{3}{4}d_G(v)\rceil$. A graph $H$ is said to be
$m$-partition-connected, if it contains $m$ edge-disjoint spanning trees. As an
application, we conclude that tough enough graphs with appropriate number of
vertices have a bipartite $m$-partition-connected factor with maximum degree at
most $3m+1$. Finally, we prove that tough enough graphs of order at least $3k$
admit a bipartite connected factor whose degrees lie in the set
$\{k,2k,3k,4k\}$.
