In this paper, it is proved that let
G be a bipartite graph with bipartition
(X,Y) and with a perfect matching
M, let
G be an
n-extendable graph, then
G is minimally
n-extendable if and only if, for any two vertices
x
X and
y
Y such that
xy
E(G), there are exactly
n internally disjoint
![View the MathML source View the MathML source](http://www.sciencedirect.com/cache/MiamiImageURL/B6V00-4NNYJC9-7-18/0?wchp=dGLbVlW-zSkWz)
-alternating paths
P1,P2,…,Pn such that
![View the MathML source View the MathML source](http://www.sciencedirect.com/cache/MiamiImageURL/B6V00-4NNYJC9-7-22/0?wchp=dGLbVlW-zSkWz)
starts and ends with edges in
E(G)
M.