{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T15:19:44Z","timestamp":1648999184180},"reference-count":6,"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(97)00032-0","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"133-143","source":"Crossref","is-referenced-by-count":0,"title":["The centroidal branches of a separable graph are edge reconstructible"],"prefix":"10.1016","volume":"179","author":[{"given":"Robert","family":"Molina","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00032-0_BIB1","doi-asserted-by":"crossref","first-page":"281","DOI":"10.2140\/pjm.1969.31.281","article-title":"On Ulam's conjecture for separable graphs","volume":"31","author":"Bondy","year":"1969","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0012-365X(97)00032-0_BIB2","series-title":"Surveys in combinatorics, 1991 (Guildford, 191), London","first-page":"221","article-title":"A graph reconstructor's manual","volume":"Vol. 166","author":"Bondy","year":"1991"},{"key":"10.1016\/S0012-365X(97)00032-0_BIB3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/jgt.3190010306","article-title":"Graph reconstruction \u2014 A survey","volume":"1","author":"Bondy","year":"1977","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(97)00032-0_BIB4","series-title":"The many facets of graph theory","first-page":"91","article-title":"Reconstructing graphs","volume":"Vol. 110","author":"Greenwell","year":"1969"},{"key":"10.1016\/S0012-365X(97)00032-0_BIB5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1002\/jgt.3190140203","article-title":"The ally-reconstruction number of a tree with five or more vertices is three","volume":"14","author":"Myrvold","year":"1990","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(97)00032-0_BIB6","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/jgt.3190120214","article-title":"The reconstruction conjecture is true if all 2-connected graphs are reconstructible","volume":"12","author":"Yang Yong Zhi","year":"1988","journal-title":"J. Graph Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97000320?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97000320?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:51:04Z","timestamp":1556131864000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97000320"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0012365X97000320"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00032-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}