One of the most difficult unsolved problems in graph theory is the Reconstruction Conjecture. Harary even referred to problems like the Four Colour Problem (now a theorem), the Hamiltonian Circuit Problem, and the ...