{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:15:46Z","timestamp":1781345746189,"version":"3.54.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T00:00:00Z","timestamp":1682467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T00:00:00Z","timestamp":1682467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["238811"],"award-info":[{"award-number":["238811"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-12-1-0049"],"award-info":[{"award-number":["N00014-12-1-0049"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10107-023-01944-6","type":"journal-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T14:05:42Z","timestamp":1682517942000},"page":"515-542","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Recognizing even-cycle and even-cut matroids"],"prefix":"10.1007","volume":"202","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8661-6196","authenticated-orcid":false,"given":"Bertrand","family":"Guenin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cheolwon","family":"Heo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,4,26]]},"reference":[{"key":"1944_CR1","unstructured":"Bixby, R. E.: Composition and decomposition of matroids and related topics. Ph.D. thesis. Cornell University (1972)"},{"key":"1944_CR2","unstructured":"Cunningham, W. H.: A combinatorial decomposition theory. Ph.D. thesis, University of Waterloo (1973)"},{"key":"1944_CR3","doi-asserted-by":"crossref","unstructured":"Edmonds J.: Matroid intersection. In: Discrete optimization I (eds P. L. Hammer, E. L. Johnson, and B. H. Korte). Ann Discrete Math 4, 39\u201349. North-Holland, Amsterdam. (1979)","DOI":"10.1016\/S0167-5060(08)70817-3"},{"key":"1944_CR4","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1137\/050629124","volume":"20","author":"JF Geelen","year":"2016","unstructured":"Geelen, J.F., Zhou, X.: A splitter theorem for internally 4-connected binary matroids. SIAM J. Discrete Math. 20, 578\u2013587 (2016)","journal-title":"SIAM J. Discrete Math."},{"key":"1944_CR5","doi-asserted-by":"crossref","unstructured":"Geelen, J. F., Gerards, A. M. H., Whittle, G.: Towards a matroid-minor structure theory. In: G. Grimmett, & C. Mcdiarmid (Eds.), Combinatorics, complexity, and chance. A tribute to dominic welsh, oxford lecture series in mathematics and its applications, Oxford: Oxford University Press 34, 72\u201382 (2007)","DOI":"10.1093\/acprof:oso\/9780198571278.003.0005"},{"key":"1944_CR6","unstructured":"Gerards, A. M. H.: Personal communication"},{"issue":"3","key":"1944_CR7","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1002\/jgt.3190200311","volume":"20","author":"AMH Gerards","year":"1995","unstructured":"Gerards, A.M.H.: On Tutte\u2019s characterization of graphic matroids - a graphic proof. J. Graph Theory 20(3), 351\u2013359 (1995)","journal-title":"J. Graph Theory"},{"key":"1944_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-023-01950-8","author":"B Guenin","year":"2023","unstructured":"Guenin, B., Heo, C.: Small separations in pinch-graphic matroids. Math. Program. (2023). https:\/\/doi.org\/10.1007\/s10107-023-01950-8","journal-title":"Math. Program."},{"key":"1944_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-023-01951-7","author":"B Guenin","year":"2023","unstructured":"Guenin, B., Heo, C.: Recognizing pinch-graphic matroids. Math. Program. (2023). https:\/\/doi.org\/10.1007\/s10107-023-01951-7","journal-title":"Math. Program."},{"key":"1944_CR10","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.jctb.2016.01.006","volume":"118","author":"B Guenin","year":"2016","unstructured":"Guenin, B., Pivotto, I., Wollan, P.: Stabilizer theorems for even cycle matroids. J. Comb. Theory Ser. B 118, 44\u201375 (2016)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1944_CR11","unstructured":"Guenin, B., Pivotto, I.: Stabilizer theorems for even cut matroids. manuscript"},{"key":"1944_CR12","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1307\/mmj\/1028989917","volume":"2","author":"F Harary","year":"1953","unstructured":"Harary, F.: On the notion of balance of a signed-graph. Michigan Math. J. 2, 143\u2013146 (1953)","journal-title":"Michigan Math. J."},{"key":"1944_CR13","doi-asserted-by":"crossref","unstructured":"Heo, C., Guenin, B.: Recognizing even-cycle and even-cut matroids. 21st international conference, IPCO 2020, London, Jun 8\u201310, 2020, Proceedings, 182\u2013195 (2020)","DOI":"10.1007\/978-3-030-45771-6_15"},{"key":"1944_CR14","unstructured":"Heo, C.: Recognizing even-cycle and even-cut matroids. Master\u2019s thesis, University of Waterloo (2016)"},{"key":"1944_CR15","unstructured":"Lawler, E.: Combinatorial optimization: networks and matroids. Hot., Rinehart and Winston, New York. Reprinted 2001, Dover, Mineola"},{"key":"1944_CR16","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0195-6698(03)00106-9","volume":"24","author":"M Lemos","year":"2003","unstructured":"Lemos, M., Oxley, J.: On the minor-minimal 3-connected matroids having a fixed minor. European J. Combin. 24, 1097\u20131123 (2003)","journal-title":"European J. Combin."},{"key":"1944_CR17","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566946.001.0001","volume-title":"Matroid Theory","author":"J Oxley","year":"2011","unstructured":"Oxley, J.: Matroid Theory. Oxford University Press, New York (2011)"},{"key":"1944_CR18","unstructured":"Pivotto, I.: Even cycle and even cut matroids. Ph.D. thesis, University of Waterloo (2011)"},{"key":"1944_CR19","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0167-5060(08)70855-0","volume":"8","author":"PD Seymour","year":"1980","unstructured":"Seymour, P.D.: On Tutte\u2019s characterization of graphic matroids. Ann. Discrete Math. 8, 83\u201390 (1980)","journal-title":"Ann. Discrete Math."},{"key":"1944_CR20","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0095-8956(80)90075-1","volume":"28","author":"PD Seymour","year":"1980","unstructured":"Seymour, P.D.: Decomposition of regular matroids. J. Combin. Theory Ser. B 28, 305\u2013359 (1980)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1944_CR21","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF02579179","volume":"1","author":"PD Seymour","year":"1981","unstructured":"Seymour, P.D.: Recognizing graphic matroids. Combinatorica 1, 75\u201378 (1981)","journal-title":"Combinatorica"},{"key":"1944_CR22","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1090\/S0002-9947-1959-0101527-3","volume":"90","author":"WT Tutte","year":"1959","unstructured":"Tutte, W.T.: Matroids and graphs. Trans. Amer. Math. Soc. 90, 527\u2013552 (1959)","journal-title":"Trans. Amer. Math. Soc."},{"key":"1944_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.6028\/jres.069B.001","volume":"69B","author":"WT Tutte","year":"1965","unstructured":"Tutte, W.T.: Lectures on matroids. J. Res. Nat. Bur. Standards Sect. B 69B, 1\u201347 (1965)","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"1944_CR24","first-page":"905","volume":"11","author":"WT Tutte","year":"1960","unstructured":"Tutte, W.T.: An algorithm for determining whether a given binary matroid is graphic. Proc. Amer. Math. Soc. 11, 905\u2013917 (1960)","journal-title":"Proc. Amer. Math. Soc."},{"key":"1944_CR25","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.4153\/CJM-1966-129-2","volume":"18","author":"WT Tutte","year":"1966","unstructured":"Tutte, W.T.: Connectivity in matroids. Canad. J. Math. 18, 1301\u20131324 (1966)","journal-title":"Canad. J. Math."},{"key":"1944_CR26","doi-asserted-by":"publisher","first-page":"245","DOI":"10.2307\/2371127","volume":"55","author":"H Whitney","year":"1933","unstructured":"Whitney, H.: 2-isomorphic graphs. Amer. J. Math. 55, 245\u2013254 (1933)","journal-title":"Amer. J. Math."},{"key":"1944_CR27","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0095-8956(91)90005-5","volume":"51","author":"T Zaslavsky","year":"1991","unstructured":"Zaslavsky, T.: Biased graphs II. The three matroids. J. Combin. Theory Ser. B 51, 46\u201372 (1991)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-01944-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-023-01944-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-01944-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,11]],"date-time":"2023-10-11T19:53:56Z","timestamp":1697054036000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-023-01944-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,26]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["1944"],"URL":"https:\/\/doi.org\/10.1007\/s10107-023-01944-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,26]]},"assertion":[{"value":"26 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}