{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:15:21Z","timestamp":1781345721206,"version":"3.54.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,12,12]],"date-time":"2006-12-12T00:00:00Z","timestamp":1165881600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2007,3,12]]},"DOI":"10.1007\/s10107-006-0053-9","type":"journal-article","created":{"date-parts":[[2006,12,13]],"date-time":"2006-12-13T13:04:12Z","timestamp":1166015052000},"page":"57-69","source":"Crossref","is-referenced-by-count":26,"title":["Combinatorial algorithms for matchings, even factors and square-free 2-factors"],"prefix":"10.1007","volume":"110","author":[{"given":"Gyula","family":"Pap","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,12,12]]},"reference":[{"key":"53_CR1","unstructured":"Bencz\u00far, A., V\u00e9gh, L.: Primal-dual approach for directed vertex-connectivity augmentation and generalizations. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, pp. 186\u2013194 (2005)"},{"key":"53_CR2","unstructured":"Cunningham, W.H., Geelen, J.F.: Vertex-disjoint directed paths and even circuits. Manuscript"},{"key":"53_CR3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01215915","volume":"17","author":"W.H. Cunningham","year":"1997","unstructured":"Cunningham W.H. and Geelen J.F. (1997). The optimal path-matching problem. Combinatorica 17: 315\u2013337","journal-title":"Combinatorica"},{"key":"53_CR4","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds J. (1965). Paths, trees and flowers. Can. J. Math. 17: 449\u2013467","journal-title":"Can. J. Math."},{"issue":"2","key":"53_CR5","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0166-218X(02)00461-4","volume":"131","author":"A. Frank","year":"2003","unstructured":"Frank A. (2003). Restricted t-matchings in bipartite graphs. Discrete Appl. Math. 131(2): 337\u2013346","journal-title":"Discrete Appl. Math."},{"key":"53_CR6","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1006\/jctb.1995.1044","volume":"65","author":"A. Frank","year":"1995","unstructured":"Frank A. and Jord\u00e1n T. (1995). Minimal edge-coverings of pairs of sets. J. Combin. Theory Ser. B 65: 73\u2013110","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"53_CR7","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1002\/jgt.10055","volume":"41","author":"A. Frank","year":"2002","unstructured":"Frank A. and Szeg\u0151 L. (2002). A note on the Path-Matching Formula. J. Graph Theory 41(2): 110\u2013119","journal-title":"J. Graph Theory"},{"key":"53_CR8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s004930070031","volume":"20","author":"J.F. Geelen","year":"2000","unstructured":"Geelen J.F. (2000). An algebraic matching algorithm. Combinatorica 20: 61\u201370","journal-title":"Combinatorica"},{"key":"53_CR9","doi-asserted-by":"crossref","unstructured":"Hartvigsen, D.: The square-free 2-factor problem in bipartite graphs. In: Integer Programming and Combinatorial Optimization Conference. Lecture Notes in Computer Science, vol. 1610, pp. 234\u2013240 (Extended abstract) (1999)","DOI":"10.1007\/3-540-48777-8_18"},{"key":"53_CR10","doi-asserted-by":"crossref","unstructured":"Hartvigsen, D.: Finding maximum square-free 2-matchings in bipartite graphs. J. Combin. Theory Ser. B (in press)","DOI":"10.1016\/j.jctb.2006.01.004"},{"key":"53_CR11","unstructured":"Kir\u00e1ly, Z.: C 4-free 2-factors in bipartite graphs, EGRES Technical Report TR-2001-13, http:\/\/www.cs.elte.hu\/egres"},{"key":"53_CR12","unstructured":"Pap, G.: Alternating paths revisited I: even factors, EGRES Technical Report TR-2004-18, http:\/\/www.cs.elte.hu\/egres"},{"issue":"2","key":"53_CR13","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.jctb.2004.01.001","volume":"91","author":"G. Pap","year":"2004","unstructured":"Pap G. and Szeg\u0151 L. (2004). On the maximum even factor in weakly symmetric graphs. J. Comb. Theory Ser. B 91(2): 201\u2013213","journal-title":"J. Comb. Theory Ser. B"},{"key":"53_CR14","doi-asserted-by":"crossref","unstructured":"Spille, B., Weismantel, R.: A generalization of Edmonds\u2019matching and matroid intersection algorithms. In: Integer Programming and Combinatorial Optimization Conference. Lecture Notes in Computer Science, vol. 2337, pp. 9\u201320 (Extended abstract) (2002)","DOI":"10.1007\/3-540-47867-1_2"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0053-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0053-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0053-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:01Z","timestamp":1559123401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-006-0053-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,12]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,3,12]]}},"alternative-id":["53"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0053-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,12]]}}}