{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:03:20Z","timestamp":1742983400061,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531730"},{"type":"electronic","value":"9783662531747"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53174-7_24","type":"book-chapter","created":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T14:50:06Z","timestamp":1470322206000},"page":"339-350","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parity Linkage and the Erd\u0151s-P\u00f3sa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs"],"prefix":"10.1007","author":[{"given":"Felix","family":"Joos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,5]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s00493-007-0047-0","volume":"27","author":"E Birmel\u00e9","year":"2007","unstructured":"Birmel\u00e9, E., Bondy, J.A., Reed, B.: The Erd\u0151s-P\u00f3sa property for long circuits. Combinatorica 27, 135\u2013145 (2007)","journal-title":"Combinatorica"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF02579268","volume":"1","author":"JA Bondy","year":"1981","unstructured":"Bondy, J.A., Lov\u00e1sz, L.: Cycles through specified vertices of a graph. Combinatorica 1, 117\u2013140 (1981)","journal-title":"Combinatorica"},{"key":"24_CR3","unstructured":"Bruhn, H., Joos, F., Schaudt, O.: Long cycles through prescribed vertices have the Erd\u0151s-P\u00f3sa property (2014). arXiv:1412.2894"},{"key":"24_CR4","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph Theory","author":"R Diestel","year":"2010","unstructured":"Diestel, R.: Graph Theory. GTM, vol. 173, 4th edn. Springer, Heidelberg (2010)","edition":"4"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/mana.19600220107","volume":"22","author":"GA Dirac","year":"1960","unstructured":"Dirac, G.A.: In abstrakten Graphen vorhandene vollst\u00e4ndige 4-Graphen und ihre Unterteilungen. Math. Nachr. 22, 61\u201385 (1960)","journal-title":"Math. Nachr."},{"key":"24_CR6","first-page":"181","volume":"6","author":"P Erd\u0151s","year":"1961","unstructured":"Erd\u0151s, P., Gallai, T.: On the minimal number of vertices representing the edges of a graph. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. 6, 181\u2013203 (1961)","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"24_CR7","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":"Erd\u0151s, P., P\u00f3sa, L.: On the maximal number of disjoint circuits of a graph. Publ. Math. Debrecen 9, 3\u201312 (1962)","journal-title":"Publ. Math. Debrecen"},{"key":"24_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. Comb. Theor. (Series B) 99, 20\u201329 (2009)","journal-title":"J. Comb. Theor. (Series B)"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s00493-013-2865-6","volume":"33","author":"N Kakimura","year":"2013","unstructured":"Kakimura, N., Kawarabayashi, K.: Half-integral packing of odd cycles through prescribed vertices. Combinatorica 33, 549\u2013572 (2013)","journal-title":"Combinatorica"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.jctb.2011.03.004","volume":"101","author":"N Kakimura","year":"2011","unstructured":"Kakimura, N., Kawarabayashi, K., Marx, D.: Packing cycles through prescribed vertices. J. Comb. Theor. (Series B) 101, 378\u2013381 (2011)","journal-title":"J. Comb. Theor. (Series B)"},{"key":"24_CR11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s00493-009-2178-y","volume":"29","author":"K Kawarabayashi","year":"2009","unstructured":"Kawarabayashi, K., Reed, B.: Highly parity linked graphs. Combinatorica 29, 215\u2013225 (2009)","journal-title":"Combinatorica"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K., Reed, B.: Odd cycle packing [extended abstract]. In: Proceedings of the 2010 ACM International Symposium on Theory of Computing, STOC 2010, pp. 695\u2013704. ACM, New York (2010)","DOI":"10.1145\/1806689.1806785"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.jctb.2005.08.001","volume":"96","author":"K Kawarabayashi","year":"2006","unstructured":"Kawarabayashi, K., Wollan, P.: Non-zero disjoint cycles in highly connected group labelled graphs. J. Comb. Theor. (Series B) 96, 296\u2013301 (2006)","journal-title":"J. Comb. Theor. (Series B)"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/BF02993903","volume":"37","author":"W Mader","year":"1972","unstructured":"Mader, W.: Existenz $$n$$ -fach zusammenh\u00e4ngender Teilgraphen in Graphen gen\u00fcgend grosser Kantendichte. Abh. Math. Sem. Univ. Hamburg 37, 86\u201397 (1972)","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1016\/j.jctb.2012.05.004","volume":"102","author":"M Pontecorvi","year":"2012","unstructured":"Pontecorvi, M., Wollan, P.: Disjoint cycles intersecting a set of vertices. J. Comb. Theor. (Series B) 102, 1134\u20131141 (2012)","journal-title":"J. Comb. Theor. (Series B)"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s004930100024","volume":"21","author":"D Rautenbach","year":"2001","unstructured":"Rautenbach, D., Reed, B.: The Erd\u0151s-P\u00f3sa property for odd cycles in highly connected graphs. Combinatorica 21, 267\u2013278 (2001)","journal-title":"Combinatorica"},{"key":"24_CR17","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, 267\u2013296 (1999)","journal-title":"Combinatorica"},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.orl.2003.10.009","volume":"32","author":"B Reed","year":"2004","unstructured":"Reed, B., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett. 32, 299\u2013301 (2004)","journal-title":"Oper. Res. Lett."},{"key":"24_CR19","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.: Graph minors. V. Excluding a planar graph. J. Comb. Theor. (Series B) 41, 92\u2013114 (1986)","journal-title":"J. Comb. Theor. (Series B)"},{"key":"24_CR20","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.ejc.2004.02.013","volume":"26","author":"R Thomas","year":"2005","unstructured":"Thomas, R., Wollan, P.: An improved linear edge bound for graph linkages. Eur. J. Comb. 26, 309\u2013324 (2005)","journal-title":"Eur. J. Comb."},{"key":"24_CR21","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s004930100028","volume":"21","author":"C Thomassen","year":"2001","unstructured":"Thomassen, C.: The Erd\u0151s-P\u00f3sa property for odd cycles in graphs of large connectivity. Combinatorica 21, 321\u2013333 (2001)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53174-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T14:01:01Z","timestamp":1692453661000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53174-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531730","9783662531747"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53174-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"5 August 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Garching","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2015","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2015","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2015","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2015","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}