{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T01:48:33Z","timestamp":1764812913050,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Science Foundation","award":["DMS- 1600592"],"award-info":[{"award-number":["DMS- 1600592"]}]},{"name":"Russian Foundation for Basic Research","award":["18-01-00353A","16-01-00499"],"award-info":[{"award-number":["18-01-00353A","16-01-00499"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["NNSFC 11871439"],"award-info":[{"award-number":["NNSFC 11871439"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s00373-020-02131-6","type":"journal-article","created":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T18:03:10Z","timestamp":1580580190000},"page":"491-501","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Degree Lists and Connectedness are 3-Reconstructible for Graphs with At Least Seven Vertices"],"prefix":"10.1007","volume":"36","author":[{"given":"Alexandr V.","family":"Kostochka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mina","family":"Nahvi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas B.","family":"West","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dara","family":"Zirlin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,1]]},"reference":[{"key":"2131_CR1","first-page":"443","volume":"97","author":"KJ Asciak","year":"2010","unstructured":"Asciak, K.J., Francalanza, M.A., Lauri, J., Myrvold, W.: A survey of some open questions in reconstruction numbers. Ars Combinatoria 97, 443\u2013456 (2010)","journal-title":"Ars Combinatoria"},{"key":"2131_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.3190140102","volume":"14","author":"B Bollob\u00e1s","year":"1990","unstructured":"Bollob\u00e1s, B.: Almost every graph has reconstruction number three. J. Graph Theory 14, 1\u20134 (1990)","journal-title":"J. Graph Theory"},{"key":"2131_CR3","doi-asserted-by":"crossref","unstructured":"Bondy, J.A.: A graph reconstructor\u2019s manual. In: Surveys in Combinatorics (Guildford, 1991), London Mathematical Society Lecture Notes 166, pp. 221\u2013252. Cambridge University Press, Cambridge (1991)","DOI":"10.1017\/CBO9780511666216.009"},{"key":"2131_CR4","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\u2014a survey. J. Graph Theory 1, 227\u2013268 (1977)","journal-title":"J. Graph Theory"},{"key":"2131_CR5","unstructured":"Chernyak, Z.A.: Some additions to an article by B. Manvel: \u201cSome basic observations on Kelly\u2019s conjecture for graphs\u201d (Russian). Vests\u012b Akad. Navuk BSSR Ser. F\u012bz.-Mat. Navuk. 126, 44\u201349 (1982)"},{"key":"2131_CR6","volume-title":"A Graph with $$p$$ Points and Enough Distinct $$(p-2)$$-Order Subgraphs is Reconstructible, Recent Trends in Graph Theory Lecture Notes in Mathematics 186","author":"P Chinn","year":"1971","unstructured":"Chinn, P.: A Graph with $$p$$ Points and Enough Distinct $$(p-2)$$-Order Subgraphs is Reconstructible, Recent Trends in Graph Theory Lecture Notes in Mathematics 186. Springer, New York (1971)"},{"key":"2131_CR7","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1002\/jgt.3190090403","volume":"9","author":"F Harary","year":"1985","unstructured":"Harary, F., Plantholt, M.: The graph reconstruction number. J. Graph Theory 9, 451\u2013454 (1985)","journal-title":"J. Graph Theory"},{"key":"2131_CR8","unstructured":"Kelly, P.J.: On isometric transformations, PhD Thesis, University of Wisconsin-Madison (1942)"},{"key":"2131_CR9","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. Pac. J. Math. 7, 961\u2013968 (1957)","journal-title":"Pac. J. Math."},{"key":"2131_CR10","first-page":"77","volume":"46","author":"J Lauri","year":"1997","unstructured":"Lauri, J.: Pseudosimilarity in graphs\u2014a survey. Ars Combinatoria 46, 77\u201395 (1997)","journal-title":"Ars Combinatoria"},{"key":"2131_CR11","unstructured":"Lauri, J., Scapellato, R.: Topics in graph automorphism and reconstruction. In: London Mathematical Society Student Texts 54, Cambridge University Press, Cambridge (2003) (Second edition: London Math. Soc. Lect. Note Series 432, Cambridge Univ. Press, Cambridge, 2016)"},{"key":"2131_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/09720529.2002.10697932","volume":"5","author":"A Maccari","year":"2002","unstructured":"Maccari, A., Rueda, O., Viazzi, V.: A survey on edge reconstruction of graphs. J. Discrete Math. Sci. Cryptogr. 5, 1\u201311 (2002)","journal-title":"J. Discrete Math. Sci. Cryptogr."},{"key":"2131_CR13","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":"2131_CR14","first-page":"85","volume":"62","author":"B McMullen","year":"2007","unstructured":"McMullen, B., Radziszowski, S.: Graph reconstruction numbers. J. Combinatorial Math. Combinatorial Comput. 62, 85\u201396 (2007)","journal-title":"J. Combinatorial Math. Combinatorial Comput."},{"key":"2131_CR15","first-page":"709","volume":"17","author":"V M\u00fcller","year":"1976","unstructured":"M\u00fcller, V.: Probabilistic reconstruction from subgraphs. Comment. Math. Univ. Carolinae 17, 709\u2013719 (1976)","journal-title":"Comment. Math. Univ. Carolinae"},{"key":"2131_CR16","unstructured":"Myrvold, W.J.: Ally and adversary reconstruction problems, Ph.D. thesis, Univ. Waterloo (1988)"},{"key":"2131_CR17","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/0012-365X(92)90689-D","volume":"108","author":"V N\u00fddl","year":"1992","unstructured":"N\u00fddl, V.: Finite undirected graphs which are not reconstructible from their large cardinality subgraphs. Discrete Math. 108, 373\u2013377 (1992)","journal-title":"Discrete Math."},{"key":"2131_CR18","first-page":"303","volume":"78","author":"D Rivshin","year":"2011","unstructured":"Rivshin, D., Radziszowski, S.: Multi-vertex deletion graph reconstruction numbers. J. Combinatorial Math. Combinatorial Comput. 78, 303\u2013321 (2011)","journal-title":"J. Combinatorial Math. Combinatorial Comput."},{"key":"2131_CR19","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":"2131_CR20","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":"2131_CR21","volume-title":"A Collection of Mathematical Problems, Interscience Tracts in Pure and Applied Mathematics 8","author":"SM Ulam","year":"1960","unstructured":"Ulam, S.M.: A Collection of Mathematical Problems, Interscience Tracts in Pure and Applied Mathematics 8. Interscience Publishers, Geneva (1960)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02131-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-020-02131-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02131-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,31]],"date-time":"2021-01-31T00:21:11Z","timestamp":1612052471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-020-02131-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,1]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["2131"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02131-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2020,2,1]]},"assertion":[{"value":"27 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}