{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,25]],"date-time":"2023-11-25T10:01:22Z","timestamp":1700906482405},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3705,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0095-8956(02)00045-x","type":"journal-article","created":{"date-parts":[[2003,2,4]],"date-time":"2003-02-04T22:09:00Z","timestamp":1044396540000},"page":"247-260","source":"Crossref","is-referenced-by-count":5,"title":["On the graphic matroid parity problem"],"prefix":"10.1016","volume":"88","author":[{"given":"Zolt\u00e1n","family":"Szigeti","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0095-8956(02)00045-X_BIB1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0095-8956(71)90041-4","article-title":"Perfect matchings of a graph","volume":"10","author":"Anderson","year":"1971","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0095-8956(02)00045-X_BIB2","first-page":"258","article-title":"Sur le couplage maximum d'un graphe","volume":"247","author":"Berge","year":"1958","journal-title":"C. R. Acad. Sci. Paris S\u00e9r. I Math."},{"key":"10.1016\/S0095-8956(02)00045-X_BIB3","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees, and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0095-8956(02)00045-X_BIB4","series-title":"Combinatorial Structures and their applications","first-page":"69","article-title":"Submodular functions, matroids, and certain polyhedra","author":"Edmonds","year":"1970"},{"issue":"3","key":"10.1016\/S0095-8956(02)00045-X_BIB5","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1145\/44483.44485","article-title":"Finding a maximum genus graph imbedding","volume":"35","author":"Furst","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/S0095-8956(02)00045-X_BIB6","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1137\/0211014","article-title":"Complexity of matroid property algorithms","volume":"11","author":"Jensen","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0095-8956(02)00045-X_BIB7","unstructured":"L. Lov\u00e1sz, Matroid matching problem, in: L. Lov\u00e1sz, V.T. S\u00f3s (Eds.), Algebraic Methods in Graph Theory, Colloquia Mathematica Societatis Janos Bolyai, Vol. 25, Szeged, North-Holland, Amsterdam, 1978, pp. 495\u2013517."},{"key":"10.1016\/S0095-8956(02)00045-X_BIB8","first-page":"121","article-title":"Selecting independent lines from a family of lines in a space","volume":"42","author":"Lov\u00e1sz","year":"1980","journal-title":"Acta Sci. Math."},{"key":"10.1016\/S0095-8956(02)00045-X_BIB9","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0095-8956(80)90066-0","article-title":"Matroid matching and some applications","volume":"28","author":"Lov\u00e1sz","year":"1980","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0095-8956(02)00045-X_BIB10","series-title":"Matching Theory","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/S0095-8956(02)00045-X_BIB11","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF01226465","article-title":"\u00dcber die maximalzahl kreuzungsfreier H-wege","volume":"21","author":"Mader","year":"1978","journal-title":"Arch. Math."},{"key":"10.1016\/S0095-8956(02)00045-X_BIB12","doi-asserted-by":"crossref","first-page":"604","DOI":"10.21136\/CMJ.1981.101776","article-title":"A new characterization of the maximum genus of a graph","volume":"106","author":"Nebesky","year":"1981","journal-title":"Czechoslovak Math. J. 31"},{"key":"10.1016\/S0095-8956(02)00045-X_BIB13","series-title":"Matroid Theory and its Applications in Electric Network Theory and in Statics","author":"Recski","year":"1989"},{"key":"10.1016\/S0095-8956(02)00045-X_BIB14","series-title":"Proceedings of the Sixth International IPCO Conference","first-page":"84","article-title":"On a min\u2013max theorem of cacti","volume":"Vol. 1412","author":"Szigeti","year":"1998"},{"key":"10.1016\/S0095-8956(02)00045-X_BIB15","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02579180","article-title":"Graph factors","volume":"1","author":"Tutte","year":"1981","journal-title":"Combinatorica"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S009589560200045X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S009589560200045X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,6,3]],"date-time":"2021-06-03T13:26:30Z","timestamp":1622726790000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S009589560200045X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S009589560200045X"],"URL":"https:\/\/doi.org\/10.1016\/s0095-8956(02)00045-x","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}