{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T14:37:15Z","timestamp":1772548635022,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1982,9,1]],"date-time":"1982-09-01T00:00:00Z","timestamp":399686400000},"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":[[1982,9]]},"DOI":"10.1007\/bf02579233","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T17:17:13Z","timestamp":1174583833000},"page":"247-274","source":"Crossref","is-referenced-by-count":89,"title":["Brick decompositions and the matching rank of graphs"],"prefix":"10.1007","volume":"2","author":[{"given":"J.","family":"Edmonds","sequence":"first","affiliation":[]},{"given":"W. R.","family":"Pulleyblank","sequence":"additional","affiliation":[]},{"given":"L.","family":"Lov\u00e1sz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02579233_CR1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, Maximum matching and a polyhedron with 0\u20131 vertices,Journal of Research of the National Bureau of Standards 69B (1965) 125\u2013130.","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"BF02579233_CR2","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, Paths, trees and flowers,Canadian Journal of Mathematics 17 (1965) 449\u2013467.","journal-title":"Canadian Journal of Mathematics"},{"key":"BF02579233_CR3","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0167-5060(08)70817-3","volume":"4","author":"J. Edmonds","year":"1979","unstructured":"J. Edmonds, Matroid intersection,Annals of Discrete Mathematics 4 (1979) 39\u201349.","journal-title":"Annals of Discrete Mathematics"},{"key":"BF02579233_CR4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.6028\/jres.071B.033","volume":"71B","author":"J. Edmonds","year":"1967","unstructured":"J. Edmonds, Systems of distinct representatives and linear algebra,Journal of Research of the National Bureau of Standards 71B (1967) 241\u2013245.","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"BF02579233_CR5","first-page":"353","volume":"9","author":"T. Gallai","year":"1964","unstructured":"T. Gallai, Maximale Systeme unabh\u00e4ngiger Kanten,Mat. Kut. Int. K\u00f6zl. 9 (1964) 353\u2013395.","journal-title":"Mat. Kut. Int. K\u00f6zl."},{"issue":"2","key":"BF02579233_CR6","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz andA. Schrijver, The ellipsoid method and its consequences for combinatorial optimization,Combinatorica 1(2) (1981) 169\u2013197.","journal-title":"Combinatorica"},{"key":"BF02579233_CR7","first-page":"83","volume":"9","author":"A. Kotzig","year":"1959","unstructured":"A. Kotzig, Ein Beitrag zur Theorie der endlichen Graphen mit linearen Faktoren I\u2014II\u2014III (in Slovak with a Germany summary),Math. Fyz. Casopis,9 (1959) pp. 83\u201391, 136\u2013159,10 (1960) 205\u2013215.","journal-title":"Math. Fyz. Casopis"},{"key":"BF02579233_CR8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01889914","volume":"23","author":"L. Lov\u00e1sz","year":"1972","unstructured":"L. Lov\u00e1sz, On the structure of factorizable graphs,Acta Math. Acad. Sci. Hung. 23 (1972) 179\u2013195.","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"BF02579233_CR9","unstructured":"L. Lov\u00e1sz andM. D. Plummer, On bicritical graphs,Infinite and Finite Sets, Colloqu. Math. Soc. J. Bolyai10, Budapest, (A. Hajnal, R. Rado and V. T. S\u00f3s et al eds) (1975) 1051\u20131079."},{"key":"BF02579233_CR10","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","volume":"28","author":"G. Minty","year":"1980","unstructured":"G. Minty, On maximal independent sets of vertices in claw-free graphs,Journal of Combinatorial Theory, Series B 28 (1980) 284\u2013304.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"BF02579233_CR11","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/BF01581025","volume":"22","author":"D. Naddef","year":"1982","unstructured":"D. Naddef, Rank of maximum matchings of a graph,Mathematical Programming 22 (1982) 52\u201370.","journal-title":"Mathematical Programming"},{"key":"BF02579233_CR12","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0012-365X(81)90006-6","volume":"34","author":"D. Naddef","year":"1981","unstructured":"D. Naddef andW. R. Pulleyblank, Matchings in regular graphs,Discrete Mathematics 34 (1981) 283\u2013290.","journal-title":"Discrete Mathematics"},{"key":"BF02579233_CR13","first-page":"285","volume":"16","author":"D. Naddef","year":"1982","unstructured":"D. Naddef andW. R. Pulleyblank, On GF2 rank and ear decomposition of elementary graphs,Annals of Discrete Mathematics 16 (1982) 285\u2013304.","journal-title":"Annals of Discrete Mathematics"},{"key":"BF02579233_CR14","unstructured":"W. R. Pulleyblank, The matching rank of Halin graphs,Report No. 80165-O R, Inst. f\u00fcr Operations Research, Universit\u00e4t Bonn (1980)."},{"key":"BF02579233_CR15","doi-asserted-by":"crossref","unstructured":"W. R. Pulleyblank andJ. Edmonds, Facets of 1-matching polyhedra,Hypergraph Seminar, (C. Berge and D. K. Ray-Chaudhuri eds),Springer Verlag (1974), 214\u2013242.","DOI":"10.1007\/BFb0066196"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579233.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579233\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579233","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T12:44:59Z","timestamp":1558183499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["BF02579233"],"URL":"https:\/\/doi.org\/10.1007\/bf02579233","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,9]]}}}