Related papers: Ulam's Conjecture is True for Connected Graphs

This submission has been withdrawn at the request of the author.

This paper was withdrawn by the author.

This paper has been withdrawn by the authors

This paper is withdrawn

Major mistake. The paper has been withdrawn.

This article has been withdrawn by the authors.

This paper has been retracted.

This paper has been withdrawn by the author

This paper has been withdrawn by the author.

This paper was withdrawn by the author.

This paper has been withdrawn by the corresponding author because the newest version is now published in Journal of Discrete Algorithms.

This paper has been withdrawn by the author(s). The material contained in the paper will be published in a subtantially reorganized form, part of it is now included in math.QA/0510174

This paper has been withdrawn by the author because Conjecture 1 is false. Please see arXiv:0901.2093 for a justification that Conjecture 1 is false. The other main results are also available from the above URL.

This paper has been withdrawn by the author ali pourmohammad.

This paper has been withdrawn by the author. The statement of the Main Theorem but is wrong in general, there have been provided counterexamples. The main theorem only holds conditionally, under the finiteness statement of theorem 2.8.

This paper has been withdrawn by the author.

This paper has been withdrawn by the author(s) and included into the new version of "An extension theorem for separately holomorphic functions with singularities", math.CV/0104089.

This paper has been withdrawn by the authors.

One of the most basic facts related to the famous Ulam reconstruction conjecture is that the connectedness of a graph can be determined by the deck of its vertex-deleted subgraphs, which are considered up to isomorphism. We strengthen this…

This paper has been withdrawn.