1977/09/01 by J. A. Bondy, Robert L. Hemminger · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Limits and Structures in Graph Theory #semigroups and automata theory
paper · doi:10.1002/jgt.3190010306
openalex publication_date 1977/09/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/23
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.