Construction for bicritical graphs and k-extendable bipartite graphs

A graph G is said to be bicritical if G-u-v has a perfect matching for every choice of a pair of points u and v. Bicritical graphs play a central role in decomposition theory of elementary graphs with respect to perfect matchings. As Plummer pointed out many times, the structure of bicritical graphs is far from completely understood. This paper presents a concise structure characterization on bicritical graphs in terms of factor-critical graphs and transversals of hypergraphs. A connected graph G with at least 2k+2 points is said to be k-extendable if it contains a matching of k lines and every such matching is contained in a perfect matching. A structure characterization for k-extendable bipartite graphs is given in a recursive way. Furthermore, this paper presents an O(mn) algorithm for determining the extendability of a bipartite graph G, the maximum integer k such that G is k-extendable, where n is the number of points and m is the number of lines in G.

[1]  M. R. Henzinffer.  Computing vertex connectivity: new bounds from old techniques , 1996, FOCS 1996.

[2]  Michael D. Plummer,et al.  On n-extendable graphs , 1980, Discret. Math..

[3]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[4]  L. Lovász.  On the structure of factorizable graphs , 1972 .

[5]  E. Lawler.  Covering Problems: Duality Relations and a New Method of Solution , 1966 .

[6]  Satish Rao,et al.  Computing Vertex Connectivity: New Bounds from Old Techniques , 2000, J. Algorithms.

[7]  Jamel Lakhal,et al.  A Polynomial Algorithm for the Extendability Problem in Bipartite Graphs , 1998, Inf. Process. Lett..

[8]  Michael D. Plummer,et al.  Extending matchings in graphs: A survey , 1994, Discret. Math..

[9]  László Lovász,et al.  Brick decompositions and the matching rank of graphs , 1982, Comb..

[10]  László Lovász,et al.  On minimal elementary bipartite graphs , 1977, J. Comb. Theory B.

[11]  László Lovász,et al.  Matching structure and the matching lattice , 1987, J. Comb. Theory, Ser. B.

[12]  Baruch Schieber,et al.  Finding the Edge Connectivity of Directed Graphs , 1989, J. Algorithms.

[13]  Heping Zhang,et al.  The Rotation Graphs of Perfect Matchings of Plane Bipartite Graphs , 1997, Discret. Appl. Math..

[14]  William McCuaig,et al.  Brace generation , 2001, J. Graph Theory.

[15]  Heping Zhang,et al.  A Note on the Number of Perfect Matchings of Bipartite Graphs , 1997, Discret. Appl. Math..

[16]  Michael D. Plummer,et al.  Matching theory - a sampler: from Dénes König to the present , 1992, Discret. Math..

[17]  William McCuaig.  Brace generation , 2001 .

[18]  L. Lovász,et al.  On a Family of Planar Bicritical Graphs , 1975 .

[19]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.