{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:38:37Z","timestamp":1778085517049,"version":"3.51.4"},"reference-count":35,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"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":8233,"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":[[1991,1]]},"DOI":"10.1016\/0095-8956(91)90005-5","type":"journal-article","created":{"date-parts":[[2004,12,21]],"date-time":"2004-12-21T20:35:48Z","timestamp":1103661348000},"page":"46-72","source":"Crossref","is-referenced-by-count":87,"title":["Biased graphs. II. The three matroids"],"prefix":"10.1016","volume":"51","author":[{"given":"Thomas","family":"Zaslavsky","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(91)90005-5_BIB1","article-title":"Infinite Exchange Systems","author":"Bean","year":"1967"},{"key":"10.1016\/0095-8956(91)90005-5_BIB2","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/0095-8956(91)90005-5_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0002-9947-1971-0288039-7","article-title":"A combinatorial model for series-parallel networks","volume":"154","author":"Brylawski","year":"1971","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0095-8956(91)90005-5_BIB4","unstructured":"T. Brylawski, Constructions, in [26, Chap. 9]."},{"key":"10.1016\/0095-8956(91)90005-5_BIB5","series-title":"Lecture Notes for the Combinatorial Theory Advanced Science Seminar","article-title":"Constructions in Combinatorial Geometry","author":"Crapo","year":"1971"},{"key":"10.1016\/0095-8956(91)90005-5_BIB6","author":"Crapo","year":"1970"},{"key":"10.1016\/0095-8956(91)90005-5_BIB7","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/0095-8956(73)90030-0","article-title":"An interrelation between line graphs, eigenvalues, and matroids","volume":"15","author":"Doob","year":"1973","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(91)90005-5_BIB8","series-title":"A Survey of Combinatorial Theory","first-page":"101","article-title":"A q-analog of the partition lattice","author":"Dowling","year":"1973"},{"key":"10.1016\/0095-8956(91)90005-5_BIB9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0095-8956(73)80007-3","article-title":"A class of geometric lattices based on finite groups","volume":"14","author":"Dowling","year":"1973","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(91)90005-5_BIB10","first-page":"121","article-title":"Elementary strong maps between combinatorial geometries","volume":"Vol. II","author":"Dowling","year":"1976"},{"key":"10.1016\/0095-8956(91)90005-5_BIB11","series-title":"Recent Progress in Combinatorics","first-page":"245","article-title":"Infinite graphs and matroids","author":"Higgs","year":"1969"},{"key":"10.1016\/0095-8956(91)90005-5_BIB12","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1090\/S0002-9947-1982-0654846-9","article-title":"Varieties of combinatorial geometries","volume":"271","author":"Kahn","year":"1982","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0095-8956(91)90005-5_BIB13","series-title":"Combinatorics","first-page":"137","article-title":"The greedy algorithm for finitary and cofinitary matroids","volume":"Vol. 19","author":"Klee","year":"1971"},{"key":"10.1016\/0095-8956(91)90005-5_BIB14","first-page":"289","article-title":"On graphs not containing indepeendent circuits (in Hungarian)","volume":"16","author":"Lov\u00e1sz","year":"1965","journal-title":"Mat. Lapok"},{"key":"10.1016\/0095-8956(91)90005-5_BIB15","unstructured":"L. Lov\u00e1sz and A. Schrijver, in preparation. (Communications from P. D. Seymour, July, 1985 and L. Lov\u00e1sz, October, 1985.)"},{"key":"10.1016\/0095-8956(91)90005-5_BIB16","series-title":"Higher Combinatorics","first-page":"133","article-title":"Matroids as the study of geometric configurations","author":"Mason","year":"1977"},{"key":"10.1016\/0095-8956(91)90005-5_BIB17","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1093\/qmath\/28.2.213","article-title":"Bicircular matroids","volume":"28","author":"Matthews","year":"1977","journal-title":"Quart. J. Math. Oxford (2)"},{"key":"10.1016\/0095-8956(91)90005-5_BIB18","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(78)90172-3","article-title":"Matroids from directed graphs","volume":"24","author":"Matthews","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(91)90005-5_BIB19","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0012-365X(77)90119-4","article-title":"Infinite graphs and bicircular matroids","volume":"19","author":"Matthews","year":"1977","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(91)90005-5_BIB20","author":"Minieka","year":"1978"},{"key":"10.1016\/0095-8956(91)90005-5_BIB21","article-title":"On Graphic Subspaces of Graphic Spaces","author":"Shih","year":"1982"},{"key":"10.1016\/0095-8956(91)90005-5_BIB22","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01111390","article-title":"On subgraphs as matroid cells","volume":"127","author":"Sim\u00f5es-Pereira","year":"1972","journal-title":"Math. Z."},{"key":"10.1016\/0095-8956(91)90005-5_BIB23","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0012-365X(75)90095-3","article-title":"On matroids on edge sets of graphs with connected subgraphs as circuits, II","volume":"12","author":"Sim\u00f5es-Pereira","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(91)90005-5_BIB24","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0095-8956(85)90057-7","article-title":"Connectivity in bicircular matroids","volume":"39","author":"Wagner","year":"1985","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(91)90005-5_BIB25","author":"Welsh","year":"1976"},{"key":"10.1016\/0095-8956(91)90005-5_BIB26","series-title":"Theory of Matroids","volume":"Vol. 26","year":"1986"},{"key":"10.1016\/0095-8956(91)90005-5_BIB27","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0166-218X(82)90033-6","article-title":"Signed graphs","volume":"4","author":"Zaslavsky","year":"1982","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0095-8956(91)90005-5_BIB28","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1093\/qmath\/33.4.493","article-title":"Bicircular geometry and the lattice of forests of a graph","volume":"33","author":"Zaslavsky","year":"1982","journal-title":"Quart. J. Math. Oxford (2)"},{"key":"10.1016\/0095-8956(91)90005-5_BIB29","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/0095-8956(89)90063-4","article-title":"Biased graphs. I. Bias, balance, and gains","volume":"47","author":"Zaslavsky","year":"1989","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(91)90005-5_BIB30","unstructured":"T. Zaslavsky, Biased graphs. III. Chromatic and dichromatic invariants, J. Combin. Theory Ser. B, submitted for publication."},{"key":"10.1016\/0095-8956(91)90005-5_BIB31","unstructured":"T. Zaslavsky, Biased graphs. IV. Geometrical realizations, J. Combin. Theory Ser. B, submitted for publication."},{"key":"10.1016\/0095-8956(91)90005-5_BIB32","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0095-8956(87)90051-7","article-title":"The biased graphs whose matroids are binary","volume":"42","author":"Zaslavsky","year":"1987","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(91)90005-5_BIB33","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01787483","article-title":"Biased graphs whose matroids are special binary matroids","volume":"6","author":"Zaslavsky","year":"1990","journal-title":"Graphs Combin."},{"key":"10.1016\/0095-8956(91)90005-5_BIB34","unstructured":"T. Zaslavsky, Matroid isomorphisms of full biased graphs, in preparation."},{"key":"10.1016\/0095-8956(91)90005-5_BIB35","unstructured":"T. Zaslavsky, Geometric lattices of structured partitions, in preparation."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895691900055?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895691900055?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T15:51:09Z","timestamp":1548863469000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895691900055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["0095895691900055"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(91)90005-5","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}