{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T20:24:32Z","timestamp":1765484672681},"reference-count":24,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":5676,"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":[[1998,1]]},"DOI":"10.1016\/s0012-365x(96)00385-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"185-203","source":"Crossref","is-referenced-by-count":7,"title":["On contractible and vertically contractible elements in 3-connected matroids and graphs"],"prefix":"10.1016","volume":"179","author":[{"given":"Haidong","family":"Wu","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00385-8_BIB1","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1017\/S0963548300000766","article-title":"Some local extremal connectivity results for matroids","volume":"2","author":"Akkari","year":"1993","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/S0012-365X(96)00385-8_BIB2","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1002\/jgt.3190170310","article-title":"The 3-connected graphs having a longest cycle containing only three contractible edges","volume":"17","author":"Aldred","year":"1993","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00385-8_BIB3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0095-8956(87)90065-7","article-title":"Contractible edges in 3-connected graphs","volume":"42","author":"Ando","year":"1987","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00385-8_BIB4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0024-3795(82)90214-2","article-title":"A simple theorem on 3-connectivity","volume":"45","author":"Bixby","year":"1982","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0012-365X(96)00385-8_BIB5_1","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0012-365X(96)00385-8_BIB5_2","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0012-365X(96)00385-8_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0002-9947-1975-0357163-6","article-title":"Modular constructions for combinatorial geometries","volume":"203","author":"Brylawski","year":"1975","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0012-365X(96)00385-8_BIB7","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0095-8956(81)90097-6","article-title":"On matroid connectivity","volume":"30","author":"Cunningham","year":"1981","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00385-8_BIB8","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1002\/jgt.3190130105","article-title":"Longest cycles in 3-connected graphs contain three contractible edges","volume":"12","author":"Dean","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00385-8_BIB9","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02579387","article-title":"Contractible edges in triangle-free graphs","volume":"6","author":"Egawa","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/S0012-365X(96)00385-8_BIB10","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0012-365X(89)90270-7","article-title":"On 3-connected matroids","volume":"73","author":"Lemos","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00385-8_BIB11","unstructured":"J.W. Leo, Triads and triangles in 3-connected matroids, submitted."},{"issue":"2","key":"10.1016\/S0012-365X(96)00385-8_BIB12","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1093\/qmath\/32.2.193","article-title":"On matroid connectivity","volume":"32","author":"Oxley","year":"1981","journal-title":"Quart. J. Math. Oxford Ser."},{"key":"10.1016\/S0012-365X(96)00385-8_BIB13","doi-asserted-by":"crossref","first-page":"20","DOI":"10.4153\/CJM-1981-003-9","article-title":"On 3-connected matroids","volume":"33","author":"Oxley","year":"1981","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0012-365X(96)00385-8_BIB14","first-page":"207","article-title":"On a matroid generalization of graph connectivity","volume":"90","author":"Oxley","year":"1981"},{"key":"10.1016\/S0012-365X(96)00385-8_BIB15","series-title":"Matroid Theory","author":"Oxley","year":"1992"},{"key":"10.1016\/S0012-365X(96)00385-8_BIB16","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0012-365X(94)00179-2","article-title":"On matroid connectivity","volume":"146","author":"Oxley","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00385-8_BIB17","unstructured":"J.G. Oxley and H. Wu, On the structure of 3-connected matroids and graphs, submitted."},{"key":"10.1016\/S0012-365X(96)00385-8_BIB18","unstructured":"J.G. Oxley and H. Wu, Matroids and graphs with few non-essential elements, submitted."},{"key":"10.1016\/S0012-365X(96)00385-8_BIB19","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\/S0012-365X(96)00385-8_BIB20","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0095-8956(80)90083-0","article-title":"Planarity and duality of finite and infinite graphs","volume":"29","author":"Thomassen","year":"1980","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00385-8_BIB21","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0095-8956(81)80025-1","article-title":"Non-separating induced cycles in graphs","volume":"31","author":"Thomassen","year":"1981","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00385-8_BIB22","first-page":"441","article-title":"A theory of 3-connected graphs","volume":"64","author":"Tutte","year":"1961"},{"key":"10.1016\/S0012-365X(96)00385-8_BIB23","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."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96003858?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96003858?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:28:58Z","timestamp":1556396938000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96003858"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":24,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0012365X96003858"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00385-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}