{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T20:33:36Z","timestamp":1772742816535,"version":"3.50.1"},"reference-count":3,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":5878,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1990,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>An edge <jats:italic>e<\/jats:italic> of a 3\u2010connected graph <jats:italic>G<\/jats:italic> is said to be <jats:italic>removable<\/jats:italic> if <jats:italic>G<\/jats:italic> \u2010 <jats:italic>e<\/jats:italic> is a subdivision of a 3\u2010connected graph. If <jats:italic>e<\/jats:italic> is not removable, then <jats:italic>e<\/jats:italic> is said to be <jats:italic>nonremovable.<\/jats:italic> In this paper, we study the distribution of removable edges in 3\u2010connected graphs and prove that a 3\u2010connected graph of order <jats:italic>n<\/jats:italic> \u2265 5 has at most [(4 <jats:italic>n<\/jats:italic> \u2014 5)\/3] nonremovable edges.<\/jats:p>","DOI":"10.1002\/jgt.3190140410","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T12:52:32Z","timestamp":1180183952000},"page":"465-473","source":"Crossref","is-referenced-by-count":16,"title":["Removable edges in 3\u2010connected graphs"],"prefix":"10.1002","volume":"14","author":[{"given":"Derek A.","family":"Holton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bill","family":"Jackson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Saito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas C.","family":"Wormald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","series-title":"Lecture Notes in Mathematics","first-page":"27","volume-title":"Many Facets of Graph Theory","author":"Barnette D. W.","year":"1966"},{"key":"e_1_2_1_3_2","volume-title":"Graphs and Digraphs","author":"Chartrand G.","year":"1986"},{"key":"e_1_2_1_4_2","first-page":"149","article-title":"K\u2010minimal 3\u2010connected cubic graphs","volume":"26","author":"Fouquet J. L.","year":"1988","journal-title":"Ars Combinat."}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190140410","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190140410","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T06:35:42Z","timestamp":1698042942000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190140410"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":3,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["10.1002\/jgt.3190140410"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190140410","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,9]]}}}