{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T14:32:16Z","timestamp":1768919536575,"version":"3.49.0"},"reference-count":3,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":7611,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1985,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The reconstruction number of graph <jats:italic>G<\/jats:italic> is the minimum number of point\u2010deleted subgraphs required in order to uniquely identify the original graph G. We list, based on computer calculations, the reconstruction number for all graphs with at most seven points. Some constructions and conjectures for graphs of higher order are given. the most striking statement is our concluding conjeture that almost all graphs have have reconstruction number three.<\/jats:p>","DOI":"10.1002\/jgt.3190090403","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T07:56:00Z","timestamp":1180425360000},"page":"451-454","source":"Crossref","is-referenced-by-count":34,"title":["The graph reconstruction number"],"prefix":"10.1002","volume":"9","author":[{"given":"Frank","family":"Harary","sequence":"first","affiliation":[]},{"given":"Michael","family":"Plantholt","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"47","volume-title":"Theory of Graphs and Its Applications","author":"Harary F.","year":"1964"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190010309"},{"key":"e_1_2_1_4_2","first-page":"29","volume-title":"A Collection of Mathematical Problems","author":"Ulam S.","year":"1960"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190090403","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190090403","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T23:24:00Z","timestamp":1697757840000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190090403"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":3,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["10.1002\/jgt.3190090403"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190090403","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,12]]}}}