{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T13:11:03Z","timestamp":1699794663596},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1972,6,1]],"date-time":"1972-06-01T00:00:00Z","timestamp":76204800000},"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":15021,"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":[[1972,6]]},"DOI":"10.1016\/0012-365x(72)90007-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:33:13Z","timestamp":1027639993000},"page":"269-278","source":"Crossref","is-referenced-by-count":9,"title":["Reconstruction of maximal outerplanar graphs"],"prefix":"10.1016","volume":"2","author":[{"given":"Bennet","family":"Manvel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(72)90007-6_BIB1","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1017\/S0305004100044364","article-title":"On Kelly's congruence theorem for trees","volume":"65","author":"Bondy","year":"1969","journal-title":"Proc. Cambridge Phil. Soc."},{"key":"10.1016\/0012-365X(72)90007-6_BIB2","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\/0012-365X(72)90007-6_BIB3","doi-asserted-by":"crossref","first-page":"1354","DOI":"10.4153\/CJM-1969-149-3","article-title":"Reconstruction of cacti","volume":"21","author":"Geller","year":"1969","journal-title":"Can. J. Math."},{"key":"10.1016\/0012-365X(72)90007-6_BIB4","series-title":"The many facts of graph theory","first-page":"91","article-title":"Reconstructing graphs","author":"Greenweil","year":"1969"},{"key":"10.1016\/0012-365X(72)90007-6_BIB5","series-title":"Theory of graphs and its applications","first-page":"47","article-title":"On the reconstruction of a graph from a collection of subgraphs","author":"Harary","year":"1964"},{"key":"10.1016\/0012-365X(72)90007-6_BIB6","doi-asserted-by":"crossref","first-page":"803","DOI":"10.4153\/CJM-1966-079-8","article-title":"The reconstruction of a tree from its maximal subtrees","volume":"18","author":"Harary","year":"1966","journal-title":"Can. J. Math."},{"key":"10.1016\/0012-365X(72)90007-6_BIB7","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01299955","article-title":"On the problem of reconstructing a tournament from subtournaments","volume":"71","author":"Harary","year":"1967","journal-title":"Monatsh. Math."},{"key":"10.1016\/0012-365X(72)90007-6_BIB8","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1090\/S0002-9939-1969-0232696-4","article-title":"On reconstructing a graph","volume":"20","author":"Hemminger","year":"1969","journal-title":"Proc. Am. Math. Soc."},{"key":"10.1016\/0012-365X(72)90007-6_BIB9","doi-asserted-by":"crossref","first-page":"961","DOI":"10.2140\/pjm.1957.7.961","article-title":"A congruence theorem for trees","volume":"7","author":"Kelly","year":"1957","journal-title":"Pacific J. Math."},{"key":"10.1016\/0012-365X(72)90007-6_BIB10","series-title":"Proof techniques in graph theory","first-page":"103","article-title":"Reconstruction of unicyclic graphs","author":"Manvel","year":"1969"},{"key":"10.1016\/0012-365X(72)90007-6_BIB11","series-title":"The many facets of graph theory","first-page":"207","article-title":"On reconstruction of graphs","author":"Manvel","year":"1969"},{"key":"10.1016\/0012-365X(72)90007-6_BIB12","doi-asserted-by":"crossref","first-page":"55","DOI":"10.4153\/CJM-1970-007-4","article-title":"Reconstruction of trees","volume":"22","author":"Manvel","year":"1970","journal-title":"Can. J. Math."},{"key":"10.1016\/0012-365X(72)90007-6_BIB13","series-title":"Ph.D. Thesis","article-title":"On reconstruction of graphs","author":"Manvel","year":"1970"},{"key":"10.1016\/0012-365X(72)90007-6_BIB14","series-title":"A collection of mathematical problems","author":"Ulam","year":"1960"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X72900076?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X72900076?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:29:12Z","timestamp":1555136952000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X72900076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1972,6]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1972,6]]}},"alternative-id":["0012365X72900076"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(72)90007-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1972,6]]}}}