{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T05:43:59Z","timestamp":1767851039368,"version":"3.49.0"},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1981,2,1]],"date-time":"1981-02-01T00:00:00Z","timestamp":349833600000},"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":11854,"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":[[1981,2]]},"DOI":"10.1016\/0095-8956(81)90097-6","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T13:03:10Z","timestamp":1099746190000},"page":"94-99","source":"Crossref","is-referenced-by-count":24,"title":["On matroid connectivity"],"prefix":"10.1016","volume":"30","author":[{"given":"William H","family":"Cunningham","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(81)90097-6_BIB1","series-title":"Graph Theory and Related Topics","first-page":"91","article-title":"Matroids, graphs and 3-connectivity","author":"Bixby","year":"1979"},{"key":"10.1016\/0095-8956(81)90097-6_BIB2","article-title":"A Combinatorial Decomposition Theory","author":"Cunningham","year":"1973"},{"key":"10.1016\/0095-8956(81)90097-6_BIB3","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\/0095-8956(81)90097-6_BIB4","unstructured":"L. Lov\u00e1sz, The matroid parity problem, to appear."},{"key":"10.1016\/0095-8956(81)90097-6_BIB5","series-title":"Connectivity in Graphs","author":"Tutte","year":"1966"},{"key":"10.1016\/0095-8956(81)90097-6_BIB6","doi-asserted-by":"crossref","first-page":"1301","DOI":"10.4153\/CJM-1966-129-2","article-title":"Connectivity in matroids","volume":"18","author":"Tutte","year":"1966","journal-title":"Canad. J. Math."},{"key":"10.1016\/0095-8956(81)90097-6_BIB7","series-title":"Introduction to the Theory of Matroids","author":"Tutte","year":"1971"},{"key":"10.1016\/0095-8956(81)90097-6_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01837870","article-title":"Bridges and hamiltonian circuits in planar graphs","volume":"15","author":"Tutte","year":"1977","journal-title":"Aequationes Math."},{"key":"10.1016\/0095-8956(81)90097-6_BIB9","series-title":"Matroid Theory","author":"Welsh","year":"1976"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895681900976?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895681900976?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T04:27:42Z","timestamp":1549081662000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895681900976"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,2]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,2]]}},"alternative-id":["0095895681900976"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(81)90097-6","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1981,2]]}}}