1. Almost every graph has reconstruction number three;Bollobás;J. Graph Theory,1990
2. Some additions to an article by B. Manvel: Some basic observations on Kelly’s conjecture for graphs (Russian), Vestsı¯;Chernyak;Akad. Navuk BSSR Ser. Fiz.-Mat. Navuk,1982
3. A graph with p points and enough distinct (p−2)-order subgraphs is reconstructible;Chinn,1971
4. On Isometric Transformations;Kelly,1942
5. A congruence theorem for trees;Kelly;Pacific J. Math.,1957