STRONG RECONSTRUCTIBILITY OF THE BLOCK-CUTPOINT TREE
M. Dowd · International Journal of Pure and Apllied Mathematics · 2013
It is shown that the multiset of reconstruction trees of the connected components of a graph is strongly reconstructible.It is then shown, that an annotated version of the block-cutpoint tree is strongly reconstructible.A refinement of this result is given.Some cases of reconstructibility of separable graphs are given.A conjecture which implies the graph reconstruction conjecture is given.