{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T22:23:34Z","timestamp":1751667814095,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T00:00:00Z","timestamp":1681948800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T00:00:00Z","timestamp":1681948800000},"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":[[2024,3]]},"DOI":"10.1007\/s10107-023-01951-7","type":"journal-article","created":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T19:33:54Z","timestamp":1682019234000},"page":"113-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Recognizing pinch-graphic matroids"],"prefix":"10.1007","volume":"204","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8661-6196","authenticated-orcid":false,"given":"Bertrand","family":"Guenin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheolwon","family":"Heo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,20]]},"reference":[{"key":"1951_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.jctb.2010.12.004","volume":"101","author":"C Chun","year":"2011","unstructured":"Chun, C., Mayhew, D., Oxley, J.: A chain theorem for internally 4-connected binary matroids. J. Combin. Theory Ser. B 101, 141\u2013189 (2011)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1951_CR2","unstructured":"Cunningham, W. H.: A combinatorial decomposition theory. Ph.D. thesis, University of Waterloo (1973)"},{"key":"1951_CR3","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":"1951_CR4","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1016\/j.jctb.2007.09.002","volume":"98","author":"J Geelen","year":"2008","unstructured":"Geelen, J., Zhou, X.: Generating weakly 4-connected matroids. J. Combin. Theory Ser. B 98, 538\u2013557 (2008)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1951_CR5","doi-asserted-by":"publisher","unstructured":"Guenin, B., Heo, C.: Recognizing even-cycle and even-cut matroids. Math. Program. (2023). https:\/\/doi.org\/10.1007\/s10107-023-01944-6","DOI":"10.1007\/s10107-023-01944-6"},{"key":"1951_CR6","doi-asserted-by":"publisher","unstructured":"Guenin, B., Heo, C.: Small separations in pinch-graphic matroids. Math. Program. (2023). https:\/\/doi.org\/10.1007\/s10107-023-01950-8","DOI":"10.1007\/s10107-023-01950-8"},{"key":"1951_CR7","unstructured":"Pivotto, I.: Even cycle and even cut matroids. Phd thesis, University of Waterloo, Waterloo, ON, Canada (2011)"},{"key":"1951_CR8","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.ejc.2015.04.005","volume":"51","author":"B Guenin","year":"2016","unstructured":"Guenin, B., Pivotto, I., Wollan, P.: Displaying blocking pairs in signed graphs. Eur. J. Comb. 51, 135\u2013164 (2016)","journal-title":"Eur. J. Comb."},{"key":"1951_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.jctb.2004.06.003","volume":"93","author":"R Hall","year":"2005","unstructured":"Hall, R.: A chain theorem for 4-connected matroids. J. Combin. Theory Ser. B 93, 45\u201366 (2005)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1951_CR10","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":"1951_CR11","doi-asserted-by":"crossref","unstructured":"Heo, C., Guenin, B.: Recognizing even-cycle and even-cut matroids. In: 21st international conference, IPCO 2020, London, UK, June 8\u201310, 2020, Proceedings, 182\u2013195 (2020)","DOI":"10.1007\/978-3-030-45771-6_15"},{"key":"1951_CR12","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, 2nd edn. Oxford University Press Inc, New York (2011)","edition":"2"},{"key":"1951_CR13","unstructured":"Pivotto, I.: Even cycle and even cut matroids. Ph.D. thesis, University of Waterloo (2011)"},{"key":"1951_CR14","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":"1951_CR15","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":"1951_CR16","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1090\/S0002-9947-1959-0101527-3","volume":"90","author":"W Tutte","year":"1959","unstructured":"Tutte, W.: Matroids and graphs. Trans. Am. Math. Soc. 90, 527\u2013552 (1959)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1","key":"1951_CR17","first-page":"161","volume":"88","author":"W Tutte","year":"1958","unstructured":"Tutte, W.: A Homotopy Theorem for Matroids, II. Trans. Am. Math. Soc. 88(1), 161\u2013174 (1958)","journal-title":"Trans. Am. Math. Soc."},{"key":"1951_CR18","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. Am. Math. Soc. 11, 905\u2013917 (1960)","journal-title":"Proc. Am. Math. Soc."},{"key":"1951_CR19","doi-asserted-by":"publisher","first-page":"245","DOI":"10.2307\/2371127","volume":"55","author":"H Whitney","year":"1933","unstructured":"Whitney, H.: 2-isomorphic graphs. Am. J. Math. 55, 245\u2013254 (1933)","journal-title":"Am. J. Math."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-01951-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-023-01951-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-01951-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T21:31:44Z","timestamp":1708032704000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-023-01951-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,20]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["1951"],"URL":"https:\/\/doi.org\/10.1007\/s10107-023-01951-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2023,4,20]]},"assertion":[{"value":"22 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}