Graph reconstruction—a survey
J. Adrian Bondy, Robert L. Hemminger · Journal of Graph Theory · 1977
Abstract The Reconstruction Conjecture asserts that every finite simple undirected graph on three or more vertices is determined, up to isomorphism, by its collection of vertex‐deleted subgraphs. This article reviews the progress made on the conjecture since it was first formulated in 1941 and discusses a number of related questions.