{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T21:15:31Z","timestamp":1694639731134},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T00:00:00Z","timestamp":1251763200000},"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":[[2009,9]]},"DOI":"10.1007\/s00493-009-2411-8","type":"journal-article","created":{"date-parts":[[2010,8,23]],"date-time":"2010-08-23T04:12:01Z","timestamp":1282536721000},"page":"619-628","source":"Crossref","is-referenced-by-count":0,"title":["A note on parity constrained orientations"],"prefix":"10.1007","volume":"29","author":[{"given":"Tam\u00e1s","family":"Kir\u00e1ly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e1cint","family":"Szab\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,8,24]]},"reference":[{"key":"2411_CR1","first-page":"258","volume":"247","author":"C. Berge","year":"1958","unstructured":"C. Berge: Sur le couplage maximum d\u2019un graphe, C. R. Acad. Sci. Paris 247 (1958), 258\u2013259.","journal-title":"C. R. Acad. Sci. Paris"},{"key":"2411_CR2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0095-8956(80)90071-4","volume":"28","author":"A. Frank","year":"1980","unstructured":"A. Frank: On the orientation of graphs, J. Combin. Theory B 28 (1980), 251\u2013261.","journal-title":"J. Combin. Theory B"},{"key":"2411_CR3","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0166-218X(01)00213-X","volume":"115","author":"A. Frank","year":"2001","unstructured":"A. Frank, T. Jord\u00e1n and Z. Szigeti: An orientation theorem with parity conditions, Discrete Applied Mathematics 115 (2001), 37\u201345.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"2411_CR4","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/S0166-218X(02)00462-6","volume":"131","author":"A. Frank","year":"2003","unstructured":"A. Frank, T. Kir\u00e1ly and Z. Kir\u00e1ly: On the orientation of graphs and hypergraphs, Discrete Applied Mathematics 131(2) (2003), 385\u2013400.","journal-title":"Discrete Applied Mathematics"},{"key":"2411_CR5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BFb0121011","volume":"22","author":"A. Frank","year":"1984","unstructured":"A. Frank, A. Seb\u0151 and \u00c9. Tardos: Covering directed and odd cuts, Mathematical Programming Study 22 (1984), 99\u2013112.","journal-title":"Mathematical Programming Study"},{"key":"2411_CR6","volume-title":"Parity problems of combinatorial polymatroids","author":"M. Makai","year":"2007","unstructured":"M. Makai: Parity problems of combinatorial polymatroids, PhD thesis, E\u00f6tv\u00f6s University, Budapest, (2007)."},{"key":"2411_CR7","doi-asserted-by":"crossref","unstructured":"M. Makai and J. Szab\u00f3: The parity problem of polymatroids without double circuits, EGRES Technical Report TR-2006-08, www.cs.elte.hu\/egres .","DOI":"10.1007\/s00493-008-2374-1"},{"issue":"106","key":"2411_CR8","doi-asserted-by":"crossref","first-page":"604","DOI":"10.21136\/CMJ.1981.101776","volume":"31","author":"L. Nebesk\u00fd","year":"1981","unstructured":"L. Nebesk\u00fd: A new characterization of the maximum genus of a graph, Czechoslovak Math. J. 31(106) (1981), 604\u2013613.","journal-title":"Czechoslovak Math. J"},{"key":"2411_CR9","volume-title":"A constructive approach to matching and its generalizations","author":"Gy. Pap","year":"2006","unstructured":"Gy. Pap: A constructive approach to matching and its generalizations, PhD thesis, E\u00f6tv\u00f6s University, Budapest, (2006)."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-009-2411-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-009-2411-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-009-2411-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,7]],"date-time":"2021-11-07T00:03:40Z","timestamp":1636243420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-009-2411-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["2411"],"URL":"https:\/\/doi.org\/10.1007\/s00493-009-2411-8","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9]]}}}