Abstract. 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.

Received: March 29, 2013

AMS Subject Classification: 05C60

Key Words and Phrases: strong reconstructibility, reconstruction tree, separability

Download paper from here.

---

DOI: 10.12732/ijpam.v87i4.2 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2013
Volume: 87
Issue: 4

---