{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T15:40:44Z","timestamp":1772638844729,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T00:00:00Z","timestamp":1772582400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T00:00:00Z","timestamp":1772582400000},"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":[[2026,4]]},"DOI":"10.1007\/s00493-026-00203-4","type":"journal-article","created":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T09:58:04Z","timestamp":1772618284000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Erd\u0151s-P\u00f3sa property of A-paths in unoriented group-labelled graphs"],"prefix":"10.1007","volume":"46","author":[{"given":"O-joung","family":"Kwon","sequence":"first","affiliation":[]},{"given":"Youngho","family":"Yoo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,4]]},"reference":[{"issue":"2","key":"203_CR1","doi-asserted-by":"publisher","first-page":"1246","DOI":"10.1137\/17M1148542","volume":"32","author":"H Bruhn","year":"2018","unstructured":"Bruhn, H., Heinlein, M., Joos, F.: Frames, $$A$$-paths, and the Erd\u0151s-P\u00f3sa property. SIAM J. Discret. Math. 32(2), 1246\u20131260 (2018)","journal-title":"SIAM J. Discret. Math."},{"key":"203_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2021.103422","volume":"99","author":"H Bruhn","year":"2022","unstructured":"Bruhn, H., Ulmer, A.: Packing $$A$$-paths of length zero modulo four. Eur. J. Comb. 99, 103422 (2022)","journal-title":"Eur. J. Comb."},{"key":"203_CR3","unstructured":"Chekan, V., Geniet, C., Hatzel, M., Pilipczuk, M., Soko\u0142owski, M., Seweryn, M.T., Witkowski, M.: Half-integral Erd\u0151s-P\u00f3sa property for non-null $$ S $$-$$ T $$ paths. arXiv preprint arXiv:2408.16344, (2024)"},{"issue":"5","key":"203_CR4","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s00493-006-0030-1","volume":"26","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Geelen, J., Gerards, B., Goddyn, L., Lohman, M., Seymour, P.: Packing non-zero $$A$$-paths in group-labelled graphs. Combinatorica 26(5), 521\u2013532 (2006)","journal-title":"Combinatorica"},{"key":"203_CR5","unstructured":"Dejter, I.J., Neumann-Lara, V.: Unboundedness for generalized odd cyclic transversality. In Combinatorics (Eger, 1987), volume\u00a052 of Colloq. Math. Soc. J\u00e1nos Bolyai, pages 195\u2013203. North-Holland, Amsterdam, (1988)"},{"key":"203_CR6","doi-asserted-by":"publisher","first-page":"347","DOI":"10.4153\/CJM-1965-035-8","volume":"17","author":"P Erd\u0151s","year":"1965","unstructured":"Erd\u0151s, P., P\u00f3sa, L.: On the independent circuits contained in a graph. Canad. J. Math. 17, 347\u2013352 (1965)","journal-title":"Canad. J. Math."},{"issue":"1\u20132","key":"203_CR7","first-page":"131","volume":"12","author":"T Gallai","year":"1961","unstructured":"Gallai, T.: Maximum-minimum s\u00e4tze und verallgemeinerte faktoren von graphen. Acta Math. Hungar. 12(1\u20132), 131\u2013173 (1961)","journal-title":"Acta Math. Hungar."},{"issue":"1","key":"203_CR8","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.jctb.2008.03.006","volume":"99","author":"J Geelen","year":"2009","unstructured":"Geelen, J., Gerards, B., Reed, B., Seymour, P., Vetta, A.: On the odd-minor variant of Hadwiger\u2019s conjecture. J. Combinatorial Theory, Series B 99(1), 20\u201329 (2009)","journal-title":"J. Combinatorial Theory, Series B"},{"key":"203_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2020.102014","volume":"126","author":"J Geelen","year":"2021","unstructured":"Geelen, J., Rodriguez, C.: Disjoint non-balanced $$A$$-paths in biased graphs. Adv. Appl. Math. 126, 102014 (2021)","journal-title":"Adv. Appl. Math."},{"issue":"1","key":"203_CR10","doi-asserted-by":"publisher","DOI":"10.1112\/jlms.12858","volume":"109","author":"JP Gollin","year":"2024","unstructured":"Gollin, J.P., Hendrey, K., Kawarabayashi, K.-I., Kwon, O., Oum, S.: A unified half-integral Erd\u0151s-P\u00f3sa theorem for cycles in graphs labelled by multiple abelian groups. J. Lond. Math. Soc. 109(1), e12858 (2024)","journal-title":"J. Lond. Math. Soc."},{"key":"203_CR11","doi-asserted-by":"publisher","first-page":"2507","DOI":"10.1007\/s00208-025-03293-5","volume":"393","author":"JP Gollin","year":"2025","unstructured":"Gollin, J.P., Hendrey, K., Kwon, O., Oum, S., Yoo, Y.: A unified Erd\u0151s-P\u00f3sa theorem for cycles in graphs labelled by multiple abelian groups. Math. Ann. 393, 2507\u20132559 (2025)","journal-title":"Math. Ann."},{"issue":"1","key":"203_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00493-017-3683-z","volume":"39","author":"T Huynh","year":"2019","unstructured":"Huynh, T., Joos, F., Wollan, P.: A unified Erd\u0151s-P\u00f3sa theorem for constrained cycles. Combinatorica 39(1), 91\u2013133 (2019)","journal-title":"Combinatorica"},{"issue":"3","key":"203_CR13","doi-asserted-by":"publisher","first-page":"2193","DOI":"10.1112\/jlms.12633","volume":"106","author":"C-H Liu","year":"2022","unstructured":"Liu, C.-H.: Packing topological minors half-integrally. J. Lond. Math. Soc. 106(3), 2193\u20132267 (2022)","journal-title":"J. Lond. Math. Soc."},{"issue":"1","key":"203_CR14","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF01226465","volume":"31","author":"W Mader","year":"1978","unstructured":"Mader, W.: \u00dcber die maximalzahl kreuzungsfreier $$H$$-Wege. Arch. Math. 31(1), 387\u2013402 (1978)","journal-title":"Arch. Math."},{"issue":"2","key":"203_CR15","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s00493-007-0056-z","volume":"27","author":"G Pap","year":"2007","unstructured":"Pap, G.: Packing non-returning $$A$$-paths. Combinatorica 27(2), 247\u2013251 (2007)","journal-title":"Combinatorica"},{"issue":"2","key":"203_CR16","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s004930050056","volume":"19","author":"B Reed","year":"1999","unstructured":"Reed, B.: Mangoes and blueberries. Combinatorica 19(2), 267\u2013296 (1999)","journal-title":"Combinatorica"},{"issue":"2","key":"203_CR17","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1006\/jctb.1994.1073","volume":"62","author":"N Robertson","year":"1994","unstructured":"Robertson, N., Seymour, P., Thomas, R.: Quickly excluding a planar graph. J. Combin. Theory Ser. B 62(2), 323\u2013348 (1994)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"203_CR18","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","volume":"41","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. V. excluding a planar graph. J. Combinatorial Theory, Series B 41(1), 92\u2013114 (1986)","journal-title":"J. Combinatorial Theory, Series B"},{"key":"203_CR19","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.jctb.2022.12.007","volume":"160","author":"R Thomas","year":"2023","unstructured":"Thomas, R., Yoo, Y.: Packing $$A$$-paths of length zero modulo a prime. J. Combinatorial Theory, Series B 160, 114\u2013143 (2023)","journal-title":"J. Combinatorial Theory, Series B"},{"key":"203_CR20","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.jctb.2023.02.011","volume":"161","author":"R Thomas","year":"2023","unstructured":"Thomas, R., Yoo, Y.: Packing cycles in undirected group-labelled graphs. J. Combinatorial Theory, Series B 161, 228\u2013267 (2023)","journal-title":"J. Combinatorial Theory, Series B"},{"issue":"1","key":"203_CR21","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/jgt.3190120111","volume":"12","author":"C Thomassen","year":"1988","unstructured":"Thomassen, C.: On the presence of disjoint subgraphs of a specified type. J. Graph Theory 12(1), 101\u2013111 (1988)","journal-title":"J. Graph Theory"},{"issue":"2","key":"203_CR22","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.jctb.2009.05.003","volume":"100","author":"P Wollan","year":"2010","unstructured":"Wollan, P.: Packing non-zero $$A$$-paths in an undirected model of group labeled graphs. J. Combinatorial Theory, Series B 100(2), 141\u2013150 (2010)","journal-title":"J. Combinatorial Theory, Series B"},{"issue":"1","key":"203_CR23","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1137\/130949877","volume":"30","author":"Y Yamaguchi","year":"2016","unstructured":"Yamaguchi, Y.: Packing $$A$$-paths in group-labelled graphs via linear matroid parity. SIAM J. Discret. Math. 30(1), 474\u2013492 (2016)","journal-title":"SIAM J. Discret. Math."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-026-00203-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-026-00203-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-026-00203-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T09:58:06Z","timestamp":1772618286000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-026-00203-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,4]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["203"],"URL":"https:\/\/doi.org\/10.1007\/s00493-026-00203-4","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,4]]},"assertion":[{"value":"7 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"9"}}