Distance hereditary graphs G of connectivity two or three and diam(G) = diam(G̅) = 3 are reconstructible

A graph is said to be reconstructible if it is determined up to isomorphism from the collection of all its one-vertex deleted unlabeled subgraphs. It is shown that all distance hereditary graphs G of connectivity two or three and diam(G) = diam(G) = 3 are reconstructible.