{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T03:21:31Z","timestamp":1765164091736,"version":"3.46.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2153507","DMS-1937241"],"award-info":[{"award-number":["DMS-2153507","DMS-1937241"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["NSFC 11871439","11971439","U20A2068"],"award-info":[{"award-number":["NSFC 11871439","11971439","U20A2068"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Arnold O. Beckman Campus Research Board of University of Illinois","award":["RB20003"],"award-info":[{"award-number":["RB20003"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s00373-025-02968-9","type":"journal-article","created":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T09:36:05Z","timestamp":1764581765000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Trees with at Least $$6\\ell +11$$ Vertices are $$\\ell $$-Reconstructible"],"prefix":"10.1007","volume":"41","author":[{"given":"Alexandr V.","family":"Kostochka","sequence":"first","affiliation":[]},{"given":"Mina","family":"Nahvi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8818-1667","authenticated-orcid":false,"given":"Douglas B.","family":"West","sequence":"additional","affiliation":[]},{"given":"Dara","family":"Zirlin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,1]]},"reference":[{"key":"2968_CR1","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1002\/jgt.3190010306","volume":"1","author":"JA Bondy","year":"1977","unstructured":"Bondy, J.A., Hemminger, R.L.: Graph reconstruction\u2013a survey. J. Graph Theory 1, 227\u2013268 (1977)","journal-title":"J. Graph Theory"},{"key":"2968_CR2","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0012-365X(76)90046-7","volume":"15","author":"WB Giles","year":"1976","unstructured":"Giles, W.B.: Reconstructing trees from two-point deleted subtrees. Discrete Math. 15, 325\u2013332 (1976)","journal-title":"Discrete Math."},{"key":"2968_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01838185","volume":"9","author":"DL Greenwell","year":"1973","unstructured":"Greenwell, D.L., Hemminger, R.L.: Reconstructing the $$n$$-connected components of a graph. Aequationes Math. 9, 19\u201322 (1973)","journal-title":"Aequationes Math."},{"key":"2968_CR4","unstructured":"Groenland, C., Johnston, T., Scott, A., Tan, J.: Reconstructing trees from small cards, arXiv.org\/pdf\/2103.13359pdf, (2021)"},{"key":"2968_CR5","unstructured":"Hunter, Z.: Optimally reconstructing caterpillars, arxiv.org\/pdf\/2112.01094pdf, (2021)"},{"key":"2968_CR6","unstructured":"Kelly, P.J.: On isometric transformations, PhD Thesis, University of Wisconsin-Madison, (1942)"},{"key":"2968_CR7","doi-asserted-by":"publisher","first-page":"961","DOI":"10.2140\/pjm.1957.7.961","volume":"7","author":"PJ Kelly","year":"1957","unstructured":"Kelly, P.J.: A congruence theorem for trees. Pacific J. Math. 7, 961\u2013968 (1957)","journal-title":"Pacific J. Math."},{"key":"2968_CR8","doi-asserted-by":"publisher","first-page":"3278","DOI":"10.1109\/TIT.2020.2983678","volume":"67","author":"AV Kostochka","year":"2021","unstructured":"Kostochka, A.V., West, D.B.: On reconstruction of graphs from the multiset of subgraphs obtained by deleting $$\\ell $$ vertices. IEEE Trans. Inf. Theory 67, 3278\u20133286 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2968_CR9","doi-asserted-by":"crossref","unstructured":"Kostochka, A.V., Nahvi, M., West, D.B., Zirlin, D.: $$3$$-reconstructibility of rooted trees. Pure Appl. Math. Q. 18, 2479\u20132509 (2022)","DOI":"10.4310\/PAMQ.2022.v18.n6.a7"},{"key":"2968_CR10","doi-asserted-by":"crossref","unstructured":"Kostochka, A.V., Nahvi, M., West, D.B., Zirlin, D.: Acyclic graphs with at least $$2\\ell +1$$ vertices are $$\\ell $$-recognizable, J. Graph Theory 109, 184\u2013200 (2025)","DOI":"10.1002\/jgt.23027"},{"key":"2968_CR11","doi-asserted-by":"crossref","unstructured":"Manvel, B.: On reconstruction of graphs, in The Many Facets of Graph Theory (Proc. Conf. Western Mich. Univ., Kalamazoo, Mich., 1968), (Springer, 1969), 207\u2013214","DOI":"10.1007\/BFb0060119"},{"key":"2968_CR12","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0012-365X(74)90064-8","volume":"8","author":"B Manvel","year":"1974","unstructured":"Manvel, B.: Some basic observations on kelly\u2019s conjecture for graphs. Discrete Math. 8, 181\u2013185 (1974)","journal-title":"Discrete Math."},{"key":"2968_CR13","first-page":"281","volume":"22","author":"V N\u00fddl","year":"1981","unstructured":"N\u00fddl, V.: Finite graphs and digraphs which are not reconstructible from their large cardinality restricted subraphs. Comment. Math. Univ. Carolin. 22, 281\u2013287 (1981)","journal-title":"Comment. Math. Univ. Carolin."},{"key":"2968_CR14","first-page":"71","volume":"31","author":"V N\u00fddl","year":"1990","unstructured":"N\u00fddl, V.: A note on reconstructing of finite trees from small subtrees. Acta Univ. Carol. Math. Phys. 31, 71\u201374 (1990)","journal-title":"Acta Univ. Carol. Math. Phys."},{"key":"2968_CR15","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1002\/jgt.22409","volume":"90","author":"H Spinoza","year":"2019","unstructured":"Spinoza, H., West, D.B.: Reconstruction from the deck of $$k$$-vertex induced subgraphs. J. Graph Theory 90, 497\u2013522 (2019)","journal-title":"J. Graph Theory"},{"key":"2968_CR16","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0012-365X(90)90035-G","volume":"79","author":"R Taylor","year":"1990","unstructured":"Taylor, R.: Reconstructing degree sequences from $$k$$-vertex-deleted subgraphs. Discrete Math. 79, 207\u2013213 (1990)","journal-title":"Discrete Math."},{"key":"2968_CR17","unstructured":"Ulam, S.M.: A collection of mathematical problems, Interscience Tracts in Pure and Applied Mathematics 8 (Interscience Publishers, 1960)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02968-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02968-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02968-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T03:20:17Z","timestamp":1765164017000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02968-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["2968"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02968-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,12]]},"assertion":[{"value":"17 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"133"}}