Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Bondy et al. (1977) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: