Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs

Lovász, 2009 Schrijver, 2003 Dantzig, 1954, Solution of a large-scale traveling-salesman problem, Oper. Res., 2, 393 Goemans, 1995, Worst-case comparison of valid inequalities for the TSP, Math. Program., 69, 335, 10.1007/BF01585563 Cook, 2012 Cook, 1998 Boyd, 2013, Finding 2-factors closer to TSP tours in cubic graphs, SIAM J. Discrete Math., 27, 918, 10.1137/110843514 Boyd, 2014, The traveling salesman problem on cubic and subcubic graphs, Math. Program., 144, 227, 10.1007/s10107-012-0620-1 Correa, 2015, TSP tours in cubic graphs: Beyond 4∕3, SIAM J. Discrete Math., 29, 915, 10.1137/140972925 Gamarnik, 2005, An improved upper bound for the TSP in cubic 3-edge connected graphs, Oper. Res. Lett., 33, 467, 10.1016/j.orl.2004.09.005 Karp, 2015, A 9∕7-approximation algorithm for graphic TSP in cubic bipartite graphs, Discrete Appl. Math., 209, 164, 10.1016/j.dam.2015.10.038 Takazawa, 2015 Takazawa, 2016, A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs, Inform. Process. Lett., 116, 550, 10.1016/j.ipl.2016.04.011 van Zuylen, 2016, Improved approximations for cubic bipartite and cubic TSP, vol. 9682, 250 Hartvigsen, 1984 Cornuéjols, 1980, A matching problem with side conditions, Discrete Math., 29, 135, 10.1016/0012-365X(80)90002-3 Hell, 1988, On restricted two-factors, SIAM J. Discrete Math., 1, 472, 10.1137/0401046 Cunningham, 2002, Matching, matroids, and extensions, Math. Program., 91, 515, 10.1007/s101070100256 Kobayashi, 2012, A proof of Cunningham’s conjecture on restricted subgraphs and jump systems, J. Combin. Theory Ser. B, 102, 948, 10.1016/j.jctb.2012.03.003 Hartvigsen, 1999, The square-free 2-factor problem in bipartite graphs, vol. 1610, 234 Király, 1999 Frank, 2003, Restricted t-matchings in bipartite graphs, Discrete Appl. Math., 131, 337, 10.1016/S0166-218X(02)00461-4 Takazawa, 2016, Decomposition theorems for square-free 2-matchings in bipartite graphs, vol. 9224, 373 Hartvigsen, 2006, Finding maximum square-free 2-matchings in bipartite graphs, J. Combin. Theory Ser. B, 96, 693, 10.1016/j.jctb.2006.01.004 Pap, 2007, Combinatorial algorithms for matchings, even factors and square-free 2-factors, Math. Program., 110, 57, 10.1007/s10107-006-0053-9 Babenko, 2012, Improved algorithms for even factors and square-free simple b-matchings, Algorithmica, 64, 362, 10.1007/s00453-012-9642-6 Makai, 2007, On maximum cost Kt,t-free t-matchings of bipartite graphs, SIAM J. Discrete Math., 21, 349, 10.1137/060652282 Takazawa, 2009, A weighted Kt,t-free t-factor algorithm for bipartite graphs, Math. Oper. Res., 34, 351, 10.1287/moor.1080.0365 J.F. Geelen, The C6-free 2-factor problem in bipartite graphs is NP-complete, 1999, unpublished. Kaiser, 2004, Planar graph colorings without short monochromatic cycles, J. Graph Theory, 46, 25, 10.1002/jgt.10167 Kaiser, 2008, Cycles intersecting edge-cuts of prescribed sizes, SIAM J. Discrete Math., 22, 861, 10.1137/070683635 Čada, 2013, {4,5} is not coverable: A counterexample to a conjecture of Kaiser and Škrekovski, SIAM J. Discrete Math., 27, 141, 10.1137/120877817 Simmons, 1978, Almost all n-dimensional rectangular lattices are hamilton laceable, vol. 21, 649 Babenko, 2010, Triangle-free 2-matchings revisited, Discrete Math. Algorithms Appl., 2, 643, 10.1142/S1793830910000930 Pap, 2004, A TDI description of restricted 2-matching polytopes, 3064, 139 Bondy, 2008 Simmons, 1981, Maximal non-Hamilton-laceable graphs, J. Graph Theory, 5, 407, 10.1002/jgt.3190050410 Simmons, 1980, Minimal Hamilton-laceable graphs, vol. 29, 893 Edmonds, 1965, Paths, trees, and flowers, Canad. J. Math., 17, 449, 10.4153/CJM-1965-045-4