Construction characterizations for defect n-extendable bipartite graphs

Abstract

A near perfect matching is a matching covering all but one vertex in a graph. Let G be a connected graph and n (|V(G)|–2)/2 be a positive integer. If any n independent edges in G are contained in a near perfect matching, then G is said to be defect n-extendable. This paper presents two construction characterizations of defect n-extendable bipartite graphs and a necessary condition for minimal defect n-extendable bipartite graphs.