{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:55:20Z","timestamp":1649206520947},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1985,12,1]],"date-time":"1985-12-01T00:00:00Z","timestamp":502243200000},"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":[[1985,12]]},"DOI":"10.1007\/bf02579247","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T21:15:24Z","timestamp":1174598124000},"page":"325-335","source":"Crossref","is-referenced-by-count":0,"title":["Families of cuts with the MFMC-property"],"prefix":"10.1007","volume":"5","author":[{"given":"A. V.","family":"Karzanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02579247_CR1","volume-title":"Lattice theory","author":"G. Birkhoff","year":"1967","unstructured":"G. Birkhoff,Lattice theory. Third edition, Amer. Math. Soc., Providence, R. I., 1967.","edition":"Third edition"},{"key":"BF02579247_CR2","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J. Edmonds","year":"1973","unstructured":"J. Edmonds andE. L. Johnson, Matchings, Euler tours and Chinese postman,Math. Programming 5 (1973), 88\u2013124.","journal-title":"Math. Programming"},{"key":"BF02579247_CR3","first-page":"93","volume-title":"Graph Theory and its Applications","author":"D. R. Fulkerson","year":"1970","unstructured":"D. R. Fulkerson, Blocking polyhedra, in:Graph Theory and its Applications (ed. Harris B., Acad. Press, NY, 1970) 93\u2013112."},{"key":"BF02579247_CR4","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/opre.11.3.344","volume":"11","author":"T. C. Hu","year":"1963","unstructured":"T. C. Hu, Multi-commodity network flows,Oper. Res. 11 (1963), 344\u2013360.","journal-title":"Oper. Res."},{"key":"BF02579247_CR5","first-page":"443","volume-title":"Finite and Infinite Sets","author":"A. V. Karzanov","year":"1984","unstructured":"A. V. Karzanov, A generalized MFMC-property and multicommodity cut problems, in:Finite and Infinite Sets (Proc. of 6th Hungarian Combinatorial Colloquium, Eger, 1981) (ed. Hajnal et al., North-Holland, Amsterdam, 1984), 443\u2013486."},{"key":"BF02579247_CR6","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/BF01588263","volume":"17","author":"A. Lehman","year":"1979","unstructured":"A. Lehman, On the width-length inequality,Math. Programming 17 (1979), 403\u2013417.","journal-title":"Math. Programming"},{"key":"BF02579247_CR7","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/BF01902352","volume":"26","author":"L. Lov\u00e1sz","year":"1975","unstructured":"L. Lov\u00e1sz, 2-matchings and 2-covers of hypergraphs,Acta Math. Acad. Sci. Hung. 26 (1975), 433\u2013444.","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"BF02579247_CR8","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,J. Combinatorical Theory (B)23 (1977), 189\u2013222.","journal-title":"J. Combinatorical Theory (B)"},{"key":"BF02579247_CR9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0012-365X(78)90116-4","volume":"23","author":"P. D. Seymour","year":"1978","unstructured":"P. D. Seymour, A two-commodity cut theorem,Discrete Math. 23 (1978), 177\u2013181.","journal-title":"Discrete Math."},{"issue":"3","key":"BF02579247_CR10","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1112\/plms\/s3-42.1.178","volume":"42","author":"P. D. Seymour","year":"1981","unstructured":"P. D. Seymour, On odd cuts and plane multicommodity flows,Proc. London Math. Soc. (3)42 (1981), 178\u2013192.","journal-title":"Proc. London Math. Soc."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579247.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579247\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579247","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\/BF02579247"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["BF02579247"],"URL":"https:\/\/doi.org\/10.1007\/bf02579247","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,12]]}}}