{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:23:57Z","timestamp":1759335837122},"reference-count":18,"publisher":"Elsevier BV","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":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,9,10]],"date-time":"2013-09-10T00:00:00Z","timestamp":1378771200000},"content-version":"vor","delay-in-days":11332,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[1982,9]]},"DOI":"10.1016\/s0195-6698(82)80039-5","type":"journal-article","created":{"date-parts":[[2013,9,9]],"date-time":"2013-09-09T12:46:39Z","timestamp":1378730799000},"page":"275-291","source":"Crossref","is-referenced-by-count":18,"title":["On the Efficiency of Representability Tests for Matroids"],"prefix":"10.1016","volume":"3","author":[{"given":"K.","family":"Truemper","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0195-6698(82)80039-5_bib1","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1287\/moor.5.3.321","article-title":"Converting linear programs to network problems","volume":"5","author":"Bixby","year":"1980","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0195-6698(82)80039-5_bib2","series-title":"Dissertation","article-title":"A combinatorial decomposition theory","author":"Cunningham","year":"1973"},{"key":"10.1016\/S0195-6698(82)80039-5_bib3","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0022-0000(80)90042-2","article-title":"An efficient PQ-graph algorithm for solving the graph realization problem","volume":"21","author":"Fujishige","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0195-6698(82)80039-5_bib4","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1111\/j.1749-6632.1979.tb32804.x","article-title":"Graph-realizability of matroids","volume":"319","author":"Inukai","year":"1979","journal-title":"Ann. N. Y. Acad. Sci."},{"key":"10.1016\/S0195-6698(82)80039-5_bib5","first-page":"376","article-title":"On the synthesis of loop and cutset matrices and the related problems","volume":"4","author":"Iri","year":"1968","journal-title":"RAAG Memoirs"},{"key":"10.1016\/S0195-6698(82)80039-5_bib6","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(77)90118-2","article-title":"The dependence graph for bases in a matroid","volume":"19","author":"Krogdahl","year":"1977","journal-title":"Discrete Math."},{"key":"10.1016\/S0195-6698(82)80039-5_bib7","series-title":"Complexity of matroid property algorithms, Report No. 78124-OR","author":"M\u00f8ller Jensen","year":"1979"},{"key":"10.1016\/S0195-6698(82)80039-5_bib8","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1017\/S0305004100056498","article-title":"The computational complexity of matroid properties","volume":"87","author":"Robinson","year":"1980","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"10.1016\/S0195-6698(82)80039-5_bib9","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0095-8956(80)90075-1","article-title":"Decomposition of regular matroids","volume":"28","author":"Seymour","year":"1980","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0195-6698(82)80039-5_bib10","doi-asserted-by":"crossref","unstructured":"P. D. Seymour, Recognizing graphic matroids, Combinatorica (to appear).","DOI":"10.1007\/BF02579179"},{"issue":"2","key":"10.1016\/S0195-6698(82)80039-5_bib11","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1112\/jlms\/s2-23.2.193","article-title":"Detecting matroid minors","volume":"23","author":"Seymour","year":"1981","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0195-6698(82)80039-5_bib12","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/0095-8956(82)90028-4","article-title":"Alpha-balanced graphs and matrices and GF(3)-representability of matroids","volume":"32","author":"Truemper","year":"1982","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0195-6698(82)80039-5_bib13","series-title":"Working Paper","article-title":"Complexity of representability tests for matroids","author":"Truemper","year":"1979"},{"key":"10.1016\/S0195-6698(82)80039-5_bib14","series-title":"Working Paper","article-title":"An efficient test for regularity of matroids","author":"Truemper","year":"1980"},{"key":"10.1016\/S0195-6698(82)80039-5_bib15","first-page":"905","article-title":"An algorithm for determining whether a given binary matroid is graphic","volume":"11","author":"Tutte","year":"1960","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/S0195-6698(82)80039-5_bib16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.6028\/jres.069B.001","article-title":"Lectures on matroids","volume":"69","author":"Tutte","year":"1965","journal-title":"J Res. Nat. Bur. Standards Sect. B"},{"key":"10.1016\/S0195-6698(82)80039-5_bib17","series-title":"Introduction to the Theory of Matroids","author":"Tutte","year":"1971"},{"key":"10.1016\/S0195-6698(82)80039-5_bib18","series-title":"Matroid Theory","author":"Welsh","year":"1976"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669882800395?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669882800395?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,13]],"date-time":"2018-10-13T08:21:57Z","timestamp":1539418917000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669882800395"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["S0195669882800395"],"URL":"https:\/\/doi.org\/10.1016\/s0195-6698(82)80039-5","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[1982,9]]}}}