Graph reconstruction—a survey

1 September 1977

journal article
research article
Published by Wiley in Journal of Graph Theory

Vol. 1 (3) , 227-268
https://doi.org/10.1002/jgt.3190010306

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.

Keywords

This publication has 60 references indexed in Scilit:

Reconstructing colored graphs
Pacific Journal of Mathematics, 1975
Reconstructing infinite graphs
Pacific Journal of Mathematics, 1974
Bemerkungen zur Ulam-Vermutung
Archiv der Mathematik, 1972
Reconstruction of maximal outerplanar graphs
Discrete Mathematics, 1972
On Ulam’s conjecture for separable graphs
Pacific Journal of Mathematics, 1969
On Kelly's congruence theorem for trees
Mathematical Proceedings of the Cambridge Philosophical Society, 1969
On the problem of reconstructing a tournament from subtournaments
Monatshefte für Mathematik, 1967
Quelques problèmes combinatoires concernant les ordres totaux et les relations monomorphes
Annales de l'institut Fourier, 1965
On some mappings related to graphs
Pacific Journal of Mathematics, 1964
A congruence theorem for trees
Pacific Journal of Mathematics, 1957