{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T10:13:59Z","timestamp":1762251239793},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1986,9,1]],"date-time":"1986-09-01T00:00:00Z","timestamp":525916800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1986,9]]},"DOI":"10.1007\/bf02579387","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T18:20:17Z","timestamp":1174587617000},"page":"269-274","source":"Crossref","is-referenced-by-count":27,"title":["Contractible edges in triangle-free graphs"],"prefix":"10.1007","volume":"6","author":[{"given":"Yoshimi","family":"Egawa","sequence":"first","affiliation":[]},{"given":"Hikoe","family":"Enomoto","sequence":"additional","affiliation":[]},{"given":"Akira","family":"Saito","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02579387_CR1","unstructured":"K. Ando, H. Enomoto andA. Saito, Contractible edges in 3-connected graphs,submitted."},{"key":"BF02579387_CR2","volume-title":"Graphs and Digraphs","author":"M. Behzad","year":"1979","unstructured":"M. Behzad, G. Chartrand andL. Lesniak-Foster,Graphs and Digraphs, Prindle, Weber & Schmidt, Boston MA, 1979."},{"key":"BF02579387_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-9967-7","volume-title":"Graph Theory","author":"B. Bollob\u00e1s","year":"1979","unstructured":"B. Bollob\u00e1s,Graph Theory, Springer-Verlag, New York NY, 1979."},{"key":"BF02579387_CR4","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0095-8956(80)90083-0","volume":"29","author":"C. Thomassen","year":"1980","unstructured":"C. Thomassen, Planarity and Duality of finite and infinite graphs,J. Combinatorial Theory Ser. B 29 (1980), 244\u2013271.","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"BF02579387_CR5","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1002\/jgt.3190050403","volume":"5","author":"C. Thomassen","year":"1981","unstructured":"C. Thomassen, Nonseparating cycles ink-connected graphs,J. Graph Theory 5 (1981), 351\u2013354.","journal-title":"J. Graph Theory"},{"key":"BF02579387_CR6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0095-8956(81)80025-1","volume":"31","author":"C. Thomassen","year":"1981","unstructured":"C. Thomassen andB. Toft, Induced non-separating cycles in graphs.J. Combinatorial Theory Ser. B 31 (1981), 199\u2013224.","journal-title":"J. Combinatorial Theory Ser. B"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579387.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579387\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579387","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T12:45:03Z","timestamp":1558183503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579387"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,9]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,9]]}},"alternative-id":["BF02579387"],"URL":"https:\/\/doi.org\/10.1007\/bf02579387","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,9]]}}}