{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T21:07:14Z","timestamp":1648588034718},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1978,6,1]],"date-time":"1978-06-01T00:00:00Z","timestamp":265507200000},"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":12830,"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":[[1978,6]]},"DOI":"10.1016\/0095-8956(78)90053-9","type":"journal-article","created":{"date-parts":[[2004,12,22]],"date-time":"2004-12-22T01:34:55Z","timestamp":1103679295000},"page":"338-343","source":"Crossref","is-referenced-by-count":3,"title":["Soldering and point splitting"],"prefix":"10.1016","volume":"24","author":[{"given":"Peter J","family":"Slater","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(78)90053-9_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02761529","article-title":"Generating planar 4-connected graphs","volume":"14","author":"Barnette","year":"1973","journal-title":"Israel J. Math."},{"key":"10.1016\/0095-8956(78)90053-9_BIB2","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/S0021-9800(69)80049-9","article-title":"A theorem on n-connected graphs","volume":"7","author":"Halin","year":"1969","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0095-8956(78)90053-9_BIB3","author":"Harary","year":"1969"},{"key":"10.1016\/0095-8956(78)90053-9_BIB4","series-title":"Proceedings of the Second Louisiana Conference on Combinatorics, Graph Theory and Computing","first-page":"257","article-title":"Characterizations and constructions of minimally 2-connected graphs and minimally strong digraphs","author":"Hedetniem","year":"1971"},{"key":"10.1016\/0095-8956(78)90053-9_BIB5","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0095-8956(74)90034-3","article-title":"A classification of 4-connected graphs","volume":"17","author":"Slater","year":"1974","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0095-8956(78)90053-9_BIB6","author":"Tutte","year":"1966"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895678900539?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895678900539?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T19:29:03Z","timestamp":1548876543000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895678900539"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,6]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1978,6]]}},"alternative-id":["0095895678900539"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(78)90053-9","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1978,6]]}}}