Finding maximum square-free 2-matchings in bipartite graphs

A 2-matching in a simple graph is a subset of edges such that every node of the graph is incident with at most two edges of the subset. A maximum 2-matching is a 2-matching of maximum size. The problem of finding a maximum 2-matching is a relaxation of the problem of finding a Hamilton tour in a graph. In this paper we study, in bipartite graphs, a problem of intermediate difficulty: The problem of finding a maximum 2-matching that contains no 4-cycles. Our main result is a polynomial time algorithm for this problem. We also present a min-max theorem.

[1]  William H. Cunningham,et al.  Matching, matroids, and extensions , 2002, Math. Program..

[2]  M. S. Krishnamoorthy,et al.  An NP-hard problem in bipartite graphs , 1975, SIGA.

[3]  J. Petersen.  Die Theorie der regulären graphs , 1891 .

[4]  A. Schrijver.  A Course in Combinatorial Optimization , 1990 .

[5]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[6]  David Hartvigsen,et al.  The Square-Free 2-Factor Problem in Bipartite Graphs , 1999, IPCO.

[7]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[8]  Eli Upfal,et al.  Fault Tolerant Sorting Networks , 1991, SIAM J. Discret. Math..

[9]  William H. Cunningham,et al.  Restricted 2-factor polytopes , 2000, Math. Program..

[10]  C Berge,et al.  TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.

[11]  W. T. Tutte.  The Factors of Graphs , 1952, Canadian Journal of Mathematics.

[12]  Jack Edmonds,et al.  Lehmans switching game and a theorem of Tutte and Nash-Williams , 1965 .

[13]  Yunsun Nam,et al.  Matching theory: subgraphs with degree constraints and other properties , 1994 .

[14]  Laurence A. Wolsey,et al.  An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit , 1979, Oper. Res..

[15]  David G. Kirkpatrick,et al.  On Restricted Two-Factors , 1988, SIAM J. Discret. Math..

[16]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[17]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[18]  Gérard Cornuéjols,et al.  A matching problem with side conditions , 1980, Discret. Math..

[19]  W. T. Tutte.  A Short Proof of the Factor Theorem for Finite Graphs , 1954, Canadian Journal of Mathematics.

[20]  András Frank.  Restricted t-matchings in bipartite graphs , 2003, Discret. Appl. Math..

[21]  W. T. Tutte.  The Factorization of Linear Graphs , 1947 .

[22]  William J. Cook,et al.  Combinatorial optimization , 1997 .