{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,26]],"date-time":"2023-09-26T23:56:53Z","timestamp":1695772613857},"reference-count":8,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1983]]},"DOI":"10.1016\/0012-365x(83)90158-9","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T17:17:57Z","timestamp":1032283077000},"page":"215-222","source":"Crossref","is-referenced-by-count":4,"title":["Duality principles for binary matroids and graphs"],"prefix":"10.1016","volume":"43","author":[{"given":"T.A.","family":"McKee","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(83)90158-9_BIB1","series-title":"The Theory of Graphs: A Basis for Network Theory","author":"Maxwell","year":"1971"},{"key":"10.1016\/0012-365X(83)90158-9_BIB2","first-page":"485","article-title":"On the axiomatic foundations of the theories of directed linear graphs, electrical networks and network-programming","volume":"15","author":"Minty","year":"1966","journal-title":"J. Math. and Mech."},{"key":"10.1016\/0012-365X(83)90158-9_BIB3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0012-365X(81)90010-8","article-title":"A quantifier for matroid duality","volume":"34","author":"McKee","year":"1981","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(83)90158-9_BIB4","first-page":"667","article-title":"Logical and matroidal duality in combinatorial linear programming","volume":"29","author":"McKee","year":"1980","journal-title":"Proc. 11th SE Conf. on Combinatorics, Graph Theory and Computing; Congressus Numerantium"},{"key":"10.1016\/0012-365X(83)90158-9_BIB5","unstructured":"T.A. McKee, Prime implicant quatifiers for matroids, graphs, and switching networks, to appear."},{"key":"10.1016\/0012-365X(83)90158-9_BIB6","doi-asserted-by":"crossref","first-page":"816","DOI":"10.1109\/TCS.1980.1084893","article-title":"The colored branch theorem and its applications","volume":"27","author":"Vandewalle","year":"1980","journal-title":"IEEE Trans. Circuits Systems"},{"key":"10.1016\/0012-365X(83)90158-9_BIB7","series-title":"Matroid Theory","author":"Welsh","year":"1976"},{"key":"10.1016\/0012-365X(83)90158-9_BIB8","first-page":"509","volume":"57","author":"Whitney","year":"1935","journal-title":"On the abstract properties of linear dependence"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X83901589?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X83901589?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T15:53:54Z","timestamp":1554825234000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X83901589"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":8,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1983]]}},"alternative-id":["0012365X83901589"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(83)90158-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}