{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:06:34Z","timestamp":1767236794125},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2011,1]]},"DOI":"10.1007\/s00493-011-2551-5","type":"journal-article","created":{"date-parts":[[2011,8,8]],"date-time":"2011-08-08T09:43:45Z","timestamp":1312796625000},"page":"95-126","source":"Crossref","is-referenced-by-count":19,"title":["Packing cycles with modularity constraints"],"prefix":"10.1007","volume":"31","author":[{"given":"Paul","family":"Wollan","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,8,9]]},"reference":[{"issue":"5","key":"2551_CR1","doi-asserted-by":"crossref","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: Packing non-zero A-paths in group labeled graphs, Combinatorica 26(5) (2006), 521\u2013532.","journal-title":"Combinatorica"},{"key":"2551_CR2","unstructured":"I. Dejter and V. Neumann-Lara: Unboundedness for generalized odd cycle traversability and a Gallai conjecture, paper presented at the Fourth Caribbean Conference on Computing, Puerto Rico, 1985."},{"key":"2551_CR3","first-page":"463","volume":"2","author":"P. Erd\u0151s","year":"1935","unstructured":"P. Erd\u0151s and G. Szekeres: A combinatorial problem in geometry, Compositio Mathematica 2 (1935), 463\u2013470.","journal-title":"Compositio Mathematica"},{"key":"2551_CR4","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02066678","volume":"12","author":"T. Gallai","year":"1961","unstructured":"T. Gallai: Maximum-minimum S\u00e4tze and verallgemeinerte Factoren von Graphen, Acta. Math. Hung. Acad. Sci. 12 (1961), 131\u2013173.","journal-title":"Acta. Math. Hung. Acad. Sci"},{"key":"2551_CR5","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.jctb.2005.03.001","volume":"95","author":"M. Kriesell","year":"2005","unstructured":"M. Kriesell: Disjoint A-paths in digraphs, J. Combin. Theory, Ser. B 95 (2005), 168\u2013172.","journal-title":"J. Combin. Theory, Ser. B"},{"key":"2551_CR6","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"},{"issue":"6","key":"2551_CR7","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1016\/j.disc.2006.07.008","volume":"307","author":"K. Kawarabayashi","year":"2007","unstructured":"K. Kawarabayashi and A. Nakamoto: The Erd\u0151s-P\u00f3sa property for vertex- and edge-disjoint odd cycles on an orientable fixed surface, Discrete Math. 307(6) (2007), 764\u2013768.","journal-title":"Discrete Math"},{"issue":"2","key":"2551_CR8","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s00493-009-2178-y","volume":"29","author":"K. Kawarabayashi","year":"2009","unstructured":"K. Kawarabayashi and B. Reed: Highly parity linked graphs, Combinatorica 29(2) (2009), 215\u2013225.","journal-title":"Combinatorica"},{"key":"2551_CR9","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1016\/j.jctb.2005.08.001","volume":"96","author":"K. Kawarabayashi","year":"2006","unstructured":"K. Kawarabayashi and P. Wollan: Non-zero disjoint cycles in highly connected group labeled graphs, J. Combin. Theory, Ser. B 96 (2006), 754\u2013757.","journal-title":"J. Combin. Theory, Ser. B"},{"key":"2551_CR10","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF01226465","volume":"31","author":"W. Mader","year":"1978","unstructured":"W. Mader: \u00dcber die Maximalzahl krezungsfreier H-Wege, Archiv der Mathematik (Basel) 31 (1978), 387\u2013402.","journal-title":"Archiv der Mathematik (Basel)"},{"issue":"7","key":"2551_CR11","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1112\/plms\/s2-50.7.509","volume":"s2-50","author":"R. Rado","year":"1949","unstructured":"R. Rado: Covering theorems for ordered sets, Proceedings of the London Math. Soc. s2-50(7) (1949), 509\u2013535.","journal-title":"Proceedings of the London Math. Soc"},{"issue":"2","key":"2551_CR12","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s004930100024","volume":"21","author":"D. Rautenbach","year":"2001","unstructured":"D. Rautenbach and B. Reed: The Erd\u0151s-P\u00f3sa property for odd cycles in highly connected graphs, Combinatorica 21(2) (2001), 267\u2013278.","journal-title":"Combinatorica"},{"issue":"2","key":"2551_CR13","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s004930050056","volume":"19","author":"B. Reed","year":"1999","unstructured":"B. Reed: Mangoes and blueberries, Combinatorica 19(2) (1999), 267\u2013296.","journal-title":"Combinatorica"},{"key":"2551_CR14","doi-asserted-by":"crossref","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 a tree-decomposition; J. Combin. Theory, Ser. B 52 (1991), 153\u2013190.","journal-title":"J. Combin. Theory, Ser. B"},{"key":"2551_CR15","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1006\/jctb.1994.1073","volume":"62","author":"N. Robertson","year":"1994","unstructured":"N. Robertson, P. Seymour and R. Thomas: Quickly excluding a planar graph, J. Combin. Thoery, Ser. B 62 (1994), 323\u2013348.","journal-title":"J. Combin. Thoery, Ser. B"},{"key":"2551_CR16","doi-asserted-by":"crossref","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\u2013110.","journal-title":"J. Graph Theory"},{"issue":"2","key":"2551_CR17","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s004930100028","volume":"21","author":"C. Thomassen","year":"2001","unstructured":"C. Thomassen: The Erd\u0151s-P\u00f3sa property for odd cycles in graphs with large connectivity, Combinatorica 21(2) (2001), 321\u2013333.","journal-title":"Combinatorica"},{"key":"2551_CR18","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.jctb.2009.05.003","volume":"100","author":"P. Wollan","year":"2010","unstructured":"P. Wollan: Packing non-zero A-paths in an undirected model of group labeled graphs, J. Combin. Thoery, Ser. B 100 (2010), 141\u2013150.","journal-title":"J. Combin. Thoery, Ser. B"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-011-2551-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-011-2551-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-011-2551-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T16:23:10Z","timestamp":1686241390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-011-2551-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["2551"],"URL":"https:\/\/doi.org\/10.1007\/s00493-011-2551-5","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1]]}}}