{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:24:00Z","timestamp":1760707440430},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1976,10,1]],"date-time":"1976-10-01T00:00:00Z","timestamp":212976000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":13438,"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":[[1976,10]]},"DOI":"10.1016\/0095-8956(76)90049-6","type":"journal-article","created":{"date-parts":[[2004,12,21]],"date-time":"2004-12-21T20:34:55Z","timestamp":1103661295000},"page":"96-103","source":"Crossref","is-referenced-by-count":144,"title":["On two minimax theorems in graph"],"prefix":"10.1016","volume":"21","author":[{"given":"L\u00e1szl\u00f3","family":"Lov\u00e1sz","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(76)90049-6_BIB1","author":"Berge","year":"1973"},{"key":"10.1016\/0095-8956(76)90049-6_BIB2","series-title":"Combinatorial Algorithms","first-page":"91","article-title":"Edge-disjoint branchings","author":"Edmonds","year":"1973"},{"key":"10.1016\/0095-8956(76)90049-6_BIB3","unstructured":"D. R. Fulkerson, Packing rooted directed cuts in a weighted directed graph, Technical report No. 157, Dept. of Operations Research, Cornell University."},{"key":"10.1016\/0095-8956(76)90049-6_BIB4","first-page":"223","article-title":"Integral boundary points of convex polyhedra","volume":"38","author":"Hoffman","year":"1956","journal-title":"Ann. of Math. Studies"},{"key":"10.1016\/0095-8956(76)90049-6_BIB5","series-title":"Hypergraph Seminar","first-page":"111","article-title":"Minimax theorems for hypergraphs","author":"Lov\u00e1sz","year":"1974"},{"key":"10.1016\/0095-8956(76)90049-6_BIB6","unstructured":"C. Lucchesi and D. H. Younger, A minimax theorem for directed graphs, to appear."},{"key":"10.1016\/0095-8956(76)90049-6_BIB7","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1112\/jlms\/s2-3.1.86","article-title":"Strong Covering of a bipartite graph","volume":"2","author":"McWhirter","year":"1971","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0095-8956(76)90049-6_BIB8","first-page":"329","article-title":"Maximum families of disjoint directed cut sets","author":"Younger","year":"1969"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895676900496?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895676900496?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T14:50:16Z","timestamp":1548859816000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895676900496"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,10]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1976,10]]}},"alternative-id":["0095895676900496"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(76)90049-6","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1976,10]]}}}