{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T06:45:30Z","timestamp":1649141130085},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2008,11,1]],"date-time":"2008-11-01T00:00:00Z","timestamp":1225497600000},"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":[[2008,11]]},"DOI":"10.1007\/s00493-008-2374-1","type":"journal-article","created":{"date-parts":[[2009,5,14]],"date-time":"2009-05-14T07:24:38Z","timestamp":1242285878000},"page":"679-692","source":"Crossref","is-referenced-by-count":2,"title":["The parity problem of polymatroids without double circuits"],"prefix":"10.1007","volume":"28","author":[{"given":"M\u00e1rton","family":"Makai","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":[[2009,5,15]]},"reference":[{"issue":"1","key":"2374_CR1","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02579199","volume":"7","author":"A. Dress","year":"1987","unstructured":"A. Dress and L. Lov\u00e1sz: On some combinatorial properties of algebraic matroids, Combinatorica 7(1) (1987), 39\u201348.","journal-title":"Combinatorica"},{"key":"2374_CR2","series-title":"Technical Report","volume-title":"Source location with rigidity and tree packing requirements","author":"Zs. Fekete","year":"2005","unstructured":"Zs. Fekete: Source location with rigidity and tree packing requirements, Technical Report TR-2005-04, Egerv\u00e1ry Research Group (EGRES), Budapest (2005). http:\/\/www.cs.elte.hu\/egres"},{"issue":"1\u20133","key":"2374_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 Appl. Math. 115(1\u20133) (2001), 37\u201347. 1st Japanese-Hungarian Symposium for Discrete Mathematics and its Applications (Kyoto, 1999).","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"2374_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 Appl. Math. 131(2) (Submodularity) (2003), 385\u2013400.","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"2374_CR5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0095-8956(80)90071-4","volume":"28","author":"A. Frank","year":"1980","unstructured":"Andr\u00e1s Frank: On the orientation of graphs, J. Combin. Theory Ser. B 28(3) (1980), 251\u2013261.","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"2374_CR6","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1137\/0211014","volume":"11","author":"P. M. Jensen","year":"1982","unstructured":"P. M. Jensen and B. Korte: Complexity of matroid property algorithms, SIAM J. Comput. 11(1) (1982), 184\u2013190.","journal-title":"SIAM J. Comput."},{"key":"2374_CR7","series-title":"Technical Report","volume-title":"A note on parity constrained orientations","author":"T. Kir\u00e1ly","year":"2003","unstructured":"T. Kir\u00e1ly and J. Szab\u00f3: A note on parity constrained orientations, Technical Report TR-2003-11, Egerv\u00e1ry Research Group, Budapest, (2003). http:\/\/www.cs.elte.hu\/egres"},{"key":"2374_CR8","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01534980","volume":"4","author":"G. Laman","year":"1970","unstructured":"G. Laman: On graphs and rigidity of plane skeletal structures, J. Engrg. Math. 4 (1970), 331\u2013340.","journal-title":"J. Engrg. Math."},{"issue":"2","key":"2374_CR9","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0095-8956(80)90066-0","volume":"28","author":"L. Lov\u00e1sz","year":"1980","unstructured":"L. Lov\u00e1sz: Matroid matching and some applications, J. Combin. Theory Ser. B 28(2) (1980), 208\u2013236.","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1\u20132","key":"2374_CR10","first-page":"121","volume":"42","author":"L. Lov\u00e1sz","year":"1980","unstructured":"L. Lov\u00e1sz: Selecting independent lines from a family of lines in a space, Acta Sci. Math. (Szeged) 42(1\u20132) (1980), 121\u2013131.","journal-title":"Acta Sci. Math. (Szeged)"},{"key":"2374_CR11","series-title":"Colloq. Math. Soc. J\u00e1nos Bolyai","first-page":"495","volume-title":"Algebraic methods in graph theory, Vol. I, II (Szeged, 1978)","author":"L. Lov\u00e1sz","year":"1981","unstructured":"L. Lov\u00e1sz: The matroid matching problem, in Algebraic methods in graph theory, Vol. I, II (Szeged, 1978), volume 25 of Colloq. Math. Soc. J\u00e1nos Bolyai, pages 495\u2013517, North-Holland, Amsterdam, 1981."},{"issue":"1","key":"2374_CR12","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1137\/0603009","volume":"3","author":"L. Lov\u00e1sz","year":"1982","unstructured":"L. Lov\u00e1sz and Y. Yemini: On generic rigidity in the plane, SIAM J. Algebraic Discrete Methods 3(1) (1982), 91\u201398.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"2374_CR13","volume-title":"A constructive approach to matching and its generalizations","author":"G. Pap","year":"2006","unstructured":"Gyula Pap: A constructive approach to matching and its generalizations, PhD thesis, E\u00f6tv\u00f6s University, Budapest, 2006."},{"key":"2374_CR14","series-title":"Algorithms and Combinatorics","volume-title":"Combinatorial optimization. Polyhedra and efficiency","author":"A. Schrijver","year":"2003","unstructured":"Alexander Schrijver: Combinatorial optimization. Polyhedra and efficiency; volume 24 of Algorithms and Combinatorics. Springer-Verlag, Berlin, 2003."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-008-2374-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-008-2374-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-008-2374-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:46Z","timestamp":1559093566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-008-2374-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["2374"],"URL":"https:\/\/doi.org\/10.1007\/s00493-008-2374-1","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11]]}}}