{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:43Z","timestamp":1761611203908},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1986,12,1]],"date-time":"1986-12-01T00:00:00Z","timestamp":533779200000},"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":[[1986,12]]},"DOI":"10.1007\/bf02579262","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T22:20:50Z","timestamp":1174602050000},"page":"365-379","source":"Crossref","is-referenced-by-count":62,"title":["Matrices with the edmonds\u2014Johnson property"],"prefix":"10.1007","volume":"6","author":[{"given":"A. M. H.","family":"Gerards","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Schrijver","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02579262_CR1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0012-365X(79)90160-2","volume":"27","author":"M. Boulala","year":"1979","unstructured":"M. Boulala andJ. P. Uhry, Polytope des ind\u00e9pendants d\u2019un graphe s\u00e9rie-parall\u00e8le,Discrete Mathematics 27 (1979), 225\u2013243.","journal-title":"Discrete Mathematics"},{"key":"BF02579262_CR2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V. Chv\u00e1tal","year":"1973","unstructured":"V. Chv\u00e1tal, Edmonds polytopes and a hierarchy of combinatorial problems,Discrete Mathematics 4 (1973), 305\u2013337.","journal-title":"Discrete Mathematics"},{"key":"BF02579262_CR3","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V. Chv\u00e1tal","year":"1975","unstructured":"V. Chv\u00e1tal, On certain polytopes associated with graphs,Journal of Combinatorial Theory (B) 18 (1975), 138\u2013154.","journal-title":"Journal of Combinatorial Theory (B)"},{"key":"BF02579262_CR4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, Maximum matching and a polyhedron with 0, 1 vertices,Journal of Research of the National Bureau of Standards (B) 69 (1965), 125\u2013130.","journal-title":"Journal of Research of the National Bureau of Standards (B)"},{"key":"BF02579262_CR5","first-page":"89","volume-title":"Combinatorial Structures and Their Applications","author":"J. Edmonds","year":"1970","unstructured":"J. Edmonds andE. L. Johnson, Matching: a well-solved class of integer linear programs,in: Combinatorial Structures and Their Applications (R. K. Guy, et al., eds.), Gordon and Breach, New York, 1970, 89\u201392."},{"key":"BF02579262_CR6","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J. Edmonds","year":"1973","unstructured":"J. Edmonds andE. L. Johnson, Euler tours and the Chinese postman,Mathematical Programming 5 (1973), 88\u2013124.","journal-title":"Mathematical Programming"},{"key":"BF02579262_CR7","first-page":"83","volume":"16","author":"J. Fonlupt","year":"1982","unstructured":"J. Fonlupt andJ. P. Uhry, Transformations which preserve perfectness andh-perfectness of graphs,Annals of Discrete Mathematics 16 (1982), 83\u201395.","journal-title":"Annals of Discrete Mathematics"},{"key":"BF02579262_CR8","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 in combinatorial optimization,Combinatorica 1 (1981), 169\u2013197.","journal-title":"Combinatorica"},{"key":"BF02579262_CR9","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0012-365X(84)90071-2","volume":"51","author":"N. Sbihi","year":"1984","unstructured":"N. Sbihi andJ. P. Uhry, A class ofh-perfect graphs,Discrete Mathematics 51 (1984), 191\u2013205.","journal-title":"Discrete Mathematics"},{"key":"BF02579262_CR10","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0095-8956(77)90031-4","volume":"23","author":"P. D. Seymour","year":"1977","unstructured":"P. D. Seymour, The matroids with the max-flow min-cut property,Journal of Combinatorial Theory (B) 23 (1977), 189\u2013222.","journal-title":"Journal of Combinatorial Theory (B)"},{"key":"BF02579262_CR11","unstructured":"K. Truemper,Max-flow min-cut matroids: polynomial testing and polynomial algorithms for maximum flow and shortest routes, preprint, University of Texas at Dallas, 1984."},{"key":"BF02579262_CR12","unstructured":"F. T. Tseng andK. Truemper,A decomposition of the matroids with the max-flow min-cut property, preprint, University of Texas at Dallas, 1984."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579262.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579262\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579262","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:45:00Z","timestamp":1558197900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,12]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1986,12]]}},"alternative-id":["BF02579262"],"URL":"https:\/\/doi.org\/10.1007\/bf02579262","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,12]]}}}