{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T04:36:04Z","timestamp":1697776564025},"reference-count":6,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":10443,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1978,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We prove that a graph <jats:italic>G<\/jats:italic> is reconstructible if <jats:italic>G<\/jats:italic> has a node <jats:italic>v<\/jats:italic> with <jats:italic>G\u2010v<\/jats:italic> acyclic. The proof uses colored graphs and shows how to reconstruct some graphs from pieces which share a common subgraph having few automorphisms.<\/jats:p>","DOI":"10.1002\/jgt.3190020105","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T06:08:31Z","timestamp":1180418911000},"page":"25-39","source":"Crossref","is-referenced-by-count":5,"title":["Nearly acyclic graphs are reconstructible"],"prefix":"10.1002","volume":"2","author":[{"given":"Bennet","family":"Manvel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph M.","family":"Weinstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0095-8956(74)90066-5","article-title":"The reconstruction of outerplanar graphs","volume":"16","author":"Giles W. B.","year":"1976","journal-title":"J. Combinatorial Theory"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1957.7.961"},{"key":"e_1_2_1_4_2","first-page":"103","volume-title":"Proof Techniques in Graph Theory","author":"Manvel B.","year":"1969"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1970-007-4"},{"key":"e_1_2_1_6_2","article-title":"On reconstructing graphs from their sets of subgraphs","author":"Manvel B.","journal-title":"J. Combinatorial Theory B"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1975.57.307"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190020105","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190020105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T10:53:34Z","timestamp":1697712814000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190020105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,3]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1978,3]]}},"alternative-id":["10.1002\/jgt.3190020105"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190020105","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978,3]]}}}