{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:47:13Z","timestamp":1758268033324},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319592497"},{"type":"electronic","value":"9783319592503"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59250-3_35","type":"book-chapter","created":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T09:04:39Z","timestamp":1495530279000},"page":"430-441","source":"Crossref","is-referenced-by-count":3,"title":["Excluded t-Factors in Bipartite Graphs: A\u00a0Unified Framework for Nonbipartite Matchings and Restricted 2-Matchings"],"prefix":"10.1007","author":[{"given":"Kenjiro","family":"Takazawa","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,24]]},"reference":[{"key":"35_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-642-13036-6_4","volume-title":"Integer Programming and Combinatorial Optimization","author":"K B\u00e9rczi","year":"2010","unstructured":"B\u00e9rczi, K., V\u00e9gh, L.A.: Restricted b-matchings in degree-bounded graphs. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol. 6080, pp. 43\u201356. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-13036-6_4"},{"key":"35_CR2","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1137\/110843514","volume":"27","author":"S Boyd","year":"2013","unstructured":"Boyd, S., Iwata, S., Takazawa, K.: Finding 2-factors closer to TSP tours in cubic graphs. SIAM J. Discrete Math. 27, 918\u2013939 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"35_CR3","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0012-365X(80)90002-3","volume":"29","author":"G Cornu\u00e9jols","year":"1980","unstructured":"Cornu\u00e9jols, G., Pulleyblank, W.: A matching problem with side conditions. Discrete Math. 29, 135\u2013159 (1980)","journal-title":"Discrete Math."},{"key":"35_CR4","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01215915","volume":"17","author":"WH Cunningham","year":"1997","unstructured":"Cunningham, W.H., Geelen, J.F.: The optimal path-matching problem. Combinatorica 17, 315\u2013337 (1997)","journal-title":"Combinatorica"},{"key":"35_CR5","unstructured":"Cunningham, W.H., Geelen, J.F.: Vertex-disjoint dipaths and even dicircuits, unpublished (2001)"},{"key":"35_CR6","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BFb0121194","volume":"8","author":"WH Cunningham","year":"1978","unstructured":"Cunningham, W.H., Marsh III, A.B.: A primal algorithm for optimum matching. Math. Program. Study 8, 50\u201372 (1978)","journal-title":"Math. Program. Study"},{"key":"35_CR7","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17, 449\u2013467 (1965)","journal-title":"Can. J. Math."},{"key":"35_CR8","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.: Restricted \n            $$t$$\n          -matchings in bipartite graphs. Discrete Appl. Math. 131, 337\u2013346 (2003)","journal-title":"Discrete Appl. Math."},{"key":"35_CR9","unstructured":"Hartvigsen, D.: Extensions of matching theory. Ph.D. thesis, Carnegie Mellon University (1984)"},{"key":"35_CR10","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1016\/j.jctb.2006.01.004","volume":"96","author":"D Hartvigsen","year":"2006","unstructured":"Hartvigsen, D.: Finding maximum square-free 2-matchings in bipartite graphs. J. Comb. Theor. Ser. B 96, 693\u2013705 (2006)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"35_CR11","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1137\/060657066","volume":"22","author":"S Iwata","year":"2008","unstructured":"Iwata, S., Takazawa, K.: The independent even factor problem. SIAM J. Discrete Math. 22, 1411\u20131427 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"35_CR12","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1137\/070683635","volume":"22","author":"T Kaiser","year":"2008","unstructured":"Kaiser, T., \u0160krekovski, R.: Cycles intersecting edge-cuts of prescribed sizes. SIAM J. Discrete Math. 22, 861\u2013874 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"35_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-25960-2_31","volume-title":"Integer Programming and Combinatorial Optimization","author":"T Kir\u00e1ly","year":"2004","unstructured":"Kir\u00e1ly, T., Makai, M.: On polyhedra related to even factors. In: Bienstock, D., Nemhauser, G. (eds.) IPCO 2004. LNCS, vol. 3064, pp. 416\u2013430. Springer, Heidelberg (2004). doi:\n10.1007\/978-3-540-25960-2_31"},{"key":"35_CR14","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1016\/j.jctb.2012.03.003","volume":"102","author":"Y Kobayashi","year":"2012","unstructured":"Kobayashi, Y., Szab\u00f3, J., Takazawa, K.: A proof of Cunningham\u2019s conjecture on restricted subgraphs and jump systems. J. Comb. Theor. Ser. B 102, 948\u2013966 (2012)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"35_CR15","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.jctb.2008.05.001","volume":"99","author":"Y Kobayashi","year":"2009","unstructured":"Kobayashi, Y., Takazawa, K.: Even factors, jump systems, and discrete convexity. J. Comb. Theor. Ser. B 99, 139\u2013161 (2009)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"35_CR16","volume-title":"Matching Theory","author":"L Lov\u00e1sz","year":"2009","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. AMS Chelsea Publishing, Providence (2009)"},{"key":"35_CR17","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1137\/060652282","volume":"21","author":"M Makai","year":"2007","unstructured":"Makai, M.: On maximum cost \n            $$K_{t, t}$$\n          -free \n            $$t$$\n          -matchings of bipartite graphs. SIAM J. Discrete Math. 21, 349\u2013360 (2007)","journal-title":"SIAM J. Discrete Math."},{"key":"35_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-540-25960-2_11","volume-title":"Integer Programming and Combinatorial Optimization","author":"G Pap","year":"2004","unstructured":"Pap, G.: A TDI description of restricted 2-matching polytopes. In: Bienstock, D., Nemhauser, G. (eds.) IPCO 2004. LNCS, vol. 3064, pp. 139\u2013151. Springer, Heidelberg (2004). doi:\n10.1007\/978-3-540-25960-2_11"},{"key":"35_CR19","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10107-006-0053-9","volume":"110","author":"G Pap","year":"2007","unstructured":"Pap, G.: Combinatorial algorithms for matchings, even factors and square-free 2-factors. Math. Program. 110, 57\u201369 (2007)","journal-title":"Math. Program."},{"key":"35_CR20","unstructured":"Takazawa, K.: Even factors: algorithms and structure. RIMS K\u00f4ky\u00fbroku Bessatsu, B23, pp. 233\u2013252. Kyoto University, Research Institute for Mathematical Sciences (2010)"},{"key":"35_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-662-53174-7_27","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"K Takazawa","year":"2016","unstructured":"Takazawa, K.: Decomposition theorems for square-free 2-matchings in bipartite graphs. In: Mayr, E.W. (ed.) WG 2015. LNCS, vol. 9224, pp. 373\u2013387. Springer, Heidelberg (2016). doi:\n10.1007\/978-3-662-53174-7_27"},{"key":"35_CR22","unstructured":"Takazawa, K.: Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs. Discrete Optim. (to appear)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59250-3_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T09:14:19Z","timestamp":1495530859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59250-3_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319592497","9783319592503"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59250-3_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}