{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:24:20Z","timestamp":1757615060813,"version":"3.44.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T00:00:00Z","timestamp":1751587200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T00:00:00Z","timestamp":1751587200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s00493-025-00160-4","type":"journal-article","created":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T06:09:05Z","timestamp":1751609345000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Signed graphs with the same even cycles"],"prefix":"10.1007","volume":"45","author":[{"given":"Bertrand","family":"Guenin","sequence":"first","affiliation":[]},{"given":"Cheolwon","family":"Heo","sequence":"additional","affiliation":[]},{"given":"Irene","family":"Pivotto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,4]]},"reference":[{"key":"160_CR1","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-82, (2007)","DOI":"10.1093\/acprof:oso\/9780198571278.003.0005"},{"key":"160_CR2","doi-asserted-by":"crossref","unstructured":"Guenin, B., Heo, C.: Recognizing even-cycle and even-cut matroids. Math Programming. 204: 113-134, (2023)","DOI":"10.1007\/s10107-023-01951-7"},{"key":"160_CR3","doi-asserted-by":"crossref","unstructured":"Guenin, B., Heo, C.: Recognizing pinch-graphic matroids. Math Programming. 204: 113-134, (2024)","DOI":"10.1007\/s10107-023-01951-7"},{"key":"160_CR4","doi-asserted-by":"crossref","unstructured":"Guenin, B., Heo, C.: Small separations in pinch-graphic matroids. Math Programming. 204: 81-111, (2024)","DOI":"10.1007\/s10107-023-01950-8"},{"key":"160_CR5","doi-asserted-by":"crossref","unstructured":"Heo, C., Guenin, B.: Recognizing Even-Cycle and Even-Cut Matroids (extended abstract). In: Bienstock D., Zambelli G. (eds) Integer Programming and Combinatorial Optimization. IPCO 2020. Lecture Notes in Computer Science, vol 12125. Springer, Cham","DOI":"10.1007\/978-3-030-45771-6_15"},{"key":"160_CR6","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s00493-020-3972-9","volume":"40","author":"Z Ferchiou","year":"2020","unstructured":"Ferchiou, Z., Guenin, B.: A Short Proof of Shih\u2019s Isomorphism Theorem on Graphic Subspaces. Combinatorica. 40, 805\u2013837 (2020)","journal-title":"Combinatorica."},{"key":"160_CR7","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. of Comb. Theory B 118, 44\u201375 (2016)","journal-title":"J. of Comb. Theory B"},{"issue":"1","key":"160_CR8","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/100798442","volume":"27","author":"B Guenin","year":"2013","unstructured":"Guenin, B., Pivotto, I., Wollan, P.: Relation between pairs of representations of signed binary matroids. SIAM J. Discrete Math. 27(1), 329\u2013341 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"160_CR9","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":"160_CR10","doi-asserted-by":"crossref","unstructured":"Heo, C.: Representations of Even-cycle and Even-cut Matroids, PhD thesis, University of Waterloo, (2021)","DOI":"10.1007\/978-3-030-45771-6_15"},{"key":"160_CR11","unstructured":"Pivotto, I.: Even cycle and even cut matroids, PhD thesis, University of Waterloo, (2011)"},{"key":"160_CR12","unstructured":"Shih, C. H.: On graphic subspaces of graphic spaces, Phd. dissertation, Ohio State Univ. (1982)"},{"key":"160_CR13","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":"160_CR14","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":"160_CR15","doi-asserted-by":"crossref","unstructured":"Whitney, H.: 2-isomorphic graphs, Amer. J. Math. 55, 245\u2013254 (1933)","DOI":"10.2307\/2371127"},{"key":"160_CR16","doi-asserted-by":"crossref","unstructured":"Zaslavsky, T.: Biased graphs I. Bias, balance, and gains, J. Comb. Theory Ser. B 47, 32\u201352 (1989)","DOI":"10.1016\/0095-8956(89)90063-4"},{"key":"160_CR17","doi-asserted-by":"crossref","unstructured":"Zaslavsky, T.: Biased graphs. II. The three matroids, J. Comb. Theory Ser. B 51, 46\u201372 (1991)","DOI":"10.1016\/0095-8956(91)90005-5"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-025-00160-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-025-00160-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-025-00160-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T12:38:42Z","timestamp":1757075922000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-025-00160-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,4]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["160"],"URL":"https:\/\/doi.org\/10.1007\/s00493-025-00160-4","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"type":"print","value":"0209-9683"},{"type":"electronic","value":"1439-6912"}],"subject":[],"published":{"date-parts":[[2025,7,4]]},"assertion":[{"value":"12 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"38"}}