Reconstruction of distance hereditary 2-connected graphs

A graph is reconstructible if it is determined up to isomorphism from the collection of all its one-vertex deleted unlabelled subgraphs. It is shown that all distance hereditary 2-connected graphs G such that diam(G)=2 or diam(G)=diam(G¯)=3 are reconstructible.