Let be a simple connected graph. For a subset of with , let denote the graph obtained from by contracting to a single vertex. The graph is also said to be obtained from by an -contraction. For pairwise disjoint subsets of , let denote the graph obtained from by contracting each () to a single vertex respectively. The graph is also said to be obtained from by a -contraction. In the present paper, based on -contraction and -contraction, some new characterizations for -extendable bipartite graphs are given.