Characterizing minimally n-extendable bipartite graphs

摘要

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 xX and yY such that xyE(G), there are exactly n internally disjoint -alternating paths P1,P2,…,Pn such that starts and ends with edges in E(G)M.