{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T04:27:11Z","timestamp":1772684831023,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,8,14]],"date-time":"2018-08-14T00:00:00Z","timestamp":1534204800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s00493-017-3683-z","type":"journal-article","created":{"date-parts":[[2018,8,14]],"date-time":"2018-08-14T02:38:56Z","timestamp":1534214336000},"page":"91-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["A Unified Erd\u0151s\u2013P\u00f3sa Theorem for Constrained Cycles"],"prefix":"10.1007","volume":"39","author":[{"given":"Tony","family":"Huynh","sequence":"first","affiliation":[]},{"given":"Felix","family":"Joos","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Wollan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,14]]},"reference":[{"key":"3683_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s00493-007-0047-0","volume":"27","author":"E. Birmel\u00e9","year":"2007","unstructured":"E. Birmel\u00e9, J.A. Bondy and B. Reed: The Erd\u0151s\u2013P\u00f3sa property for long circuits, Combinatorica 27 (2007), 135\u2013145.","journal-title":"Combinatorica"},{"key":"3683_CR2","unstructured":"H. Bruhn, F. Joos and O. Schaudt: Long cycles through prescribed vertices have the Erd\u0151s\u2013P\u00f3sa property, to appear in J. Graph Theory."},{"key":"3683_CR3","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s00493-006-0030-1","volume":"26","author":"M. Chudnovsky","year":"2006","unstructured":"M. Chudnovsky, J. Geelen, B. Gerards, L. Goddyn, M. Lohman and P. Seymour: Non-zero A-paths in group-labelled graphs, Combinatorica 26 (2006), 521\u2013532.","journal-title":"Combinatorica"},{"key":"3683_CR4","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R. P. Dilworth","year":"1950","unstructured":"R. P. Dilworth: A decomposition theorem for partially ordered sets, Ann. of Math. (2) 51 (1950), 161\u2013166.","journal-title":"Ann. of Math. (2)"},{"key":"3683_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.5486\/PMD.1962.9.1-2.02","volume":"9","author":"P. Erd\u0151s","year":"1962","unstructured":"P. Erd\u0151s and L. P\u00f3sa: On the maximal number of disjoint circuits of a graph, Publ. Math. Debrecen 9 (1962), 3\u201312.","journal-title":"Publ. Math. Debrecen"},{"key":"3683_CR6","first-page":"463","volume":"2","author":"P. Erd\u0151s","year":"1935","unstructured":"P. Erd\u0151s and G. Szekeres: A combinatorial problem in geometry, Compositio Math. 2 (1935), 463\u2013470.","journal-title":"Compositio Math."},{"key":"3683_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/jgt.21776","volume":"77","author":"S. Fiorini","year":"2013","unstructured":"S. Fiorini and A. Herinckx: A tighter Erd\u0151s\u2013P\u00f3sa function for long cycles, J. Graph Theory 77 (2013), 111\u2013116.","journal-title":"J. Graph Theory"},{"key":"3683_CR8","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.jctb.2008.07.003","volume":"99","author":"J. Geelen","year":"2009","unstructured":"J. Geelen and B. Gerards: Excluding a group-labelled graph, J. Combin. Theory Ser. B 99 (2009), 247\u2013253.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3683_CR9","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.jctb.2008.03.006","volume":"99","author":"J. Geelen","year":"2009","unstructured":"J. Geelen, B. Gerards, B. Reed, P. Seymour and A. Vetta: On the odd-minor variant of Hadwiger's conjecture, J. Combin. Theory (Series B) 99 (2009), 20\u201329.","journal-title":"J. Combin. Theory (Series B)"},{"key":"3683_CR10","volume-title":"The linkage problem for group-labelled graphs","author":"T. Huynh","year":"2009","unstructured":"T. Huynh: The linkage problem for group-labelled graphs, PhD thesis, University of Waterloo, 2009."},{"key":"3683_CR11","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.jctb.2011.03.004","volume":"101","author":"N. Kakimura","year":"2011","unstructured":"N. Kakimura, K. Kawarabayashi and D. Marx: Packing cycles through prescribed vertices, J. Combin. Theory Ser. B 101 (2011), 378\u2013381.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3683_CR12","first-page":"549","volume":"33","author":"K. Kawarabayashi","year":"2014","unstructured":"K. Kawarabayashi and N. Kakimura: Half-integral packing of odd cycles through prescribed vertices, Combinatorica 33 (2014), 549\u2013572.","journal-title":"Combinatorica"},{"key":"3683_CR13","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.jctb.2017.09.006","volume":"129","author":"K. Kawarabayashi","year":"2018","unstructured":"K. Kawarabayashi, R. Thomas and P. Wollan: A new proof of the Flat Wall Theorem, J. Combin. Theory Ser. B 129 (2018), 204\u2013238.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3683_CR14","volume-title":"The half-integral Erd\u0151s\u2013P\u00f3sa property for non-null cycles","author":"D. Lokshtanov","year":"2017","unstructured":"D. Lokshtanov, M. S. Ramanujan and S. Saurabh: The half-integral Erd\u0151s\u2013P\u00f3sa property for non-null cycles, arXiv:1703.02866, 2017."},{"key":"3683_CR15","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1016\/j.jctb.2012.05.004","volume":"102","author":"M. Pontecorvi","year":"2012","unstructured":"M. Pontecorvi and P. Wollan: Disjoint cycles intersecting a set of vertices, J. Combin. Theory (Series B) 102 (2012), 1134\u20131141.","journal-title":"J. Combin. Theory (Series B)"},{"key":"3683_CR16","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s004930050056","volume":"19","author":"B. Reed","year":"1999","unstructured":"B. Reed: Mangoes and blueberries, Combinatorica 19 (1999), 267\u2013296.","journal-title":"Combinatorica"},{"key":"3683_CR17","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N. Robertson","year":"1991","unstructured":"N. Robertson and P. Seymour: Graph minors. X. Obstructions to tree-decomposition, J. Combin. Theory Ser. B 52 (1991), 153\u2013190.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3683_CR18","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N. Robertson","year":"1995","unstructured":"N. Robertson and P. Seymour: Graph minors. XIII. The disjoint paths problem, J. Combin. Theory Ser. B 63 (1995), 65\u2013110.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3683_CR19","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/jgt.3190120111","volume":"12","author":"C. Thomassen","year":"1988","unstructured":"C. Thomassen: On the presence of disjoint subgraphs of a specified type, J. Graph Theory 12 (1988), 101\u2013111.","journal-title":"J. Graph Theory"},{"key":"3683_CR20","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00493-011-2551-5","volume":"31","author":"P. Wollan","year":"2011","unstructured":"P. Wollan: Packing cycles with modularity constraints, Combinatorica 31 (2011), 95\u2013126.","journal-title":"Combinatorica"},{"key":"3683_CR21","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/0095-8956(89)90063-4","volume":"47","author":"T. Zaslavsky","year":"1989","unstructured":"T. Zaslavsky: Biased graphs. I. Bias, balance, and gains, J. Combin. Theory Ser. B 47 (1989), 32\u201352.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3683_CR22","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0095-8956(91)90005-5","volume":"51","author":"T. Zaslavsky","year":"1991","unstructured":"T. Zaslavsky: Biased graphs. II. The three matroids, J. Combin. Theory Ser. B 51 (1991), 46\u201372.","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-017-3683-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-017-3683-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-017-3683-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T09:58:11Z","timestamp":1693821491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-017-3683-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,14]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["3683"],"URL":"https:\/\/doi.org\/10.1007\/s00493-017-3683-z","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,14]]},"assertion":[{"value":"10 August 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}