Abstract
We prove a theorem implying the conjecture of J. A. Bondy and R. L. Hemminger that an infinite, locally finite tree containing no two-way infinite path is uniquely determined, up to isomorphism, from its collection of vertex-deleted subgraphs.
Similar content being viewed by others
References
J. A. Bondy andR. L. Hemminger,Reconstructing infinite graphs, Pacific J. Math.52 (1974), 331–340.
-J. A. Bondy and -R. L. Hemminger,Almost reconstructing infinite graphs, in: Recent Advances in Graph Theory (Proc. of the Symposium held in Prague, 1974, M. Fiedler, ed.) Academia, Prague, 69–73.
— and —,Problem in the Proceedings of the Fifth British Combinatorial Conference, Congressus Numeratium XV, C. St. J. A. Nash-Williams and J. Sheehan, Eds., Utilitas Mathematica Publishing Inc., Winnipeg, 1976, p. 696.
— and-—,Graph Reconstruction—A Survey, J. Graph Theory1 (1977), 227–268.
J. Fisher R. L. Graham andF. Harary,A counterexample to the countable version of a conjecture of Ulam, J. Combinatorial Theory (B)12 (1972), 203–204.
F. Harary, A. J. Schwenk andR. L. Scott,On the reconstruction of countable forests, Publ. Math. Inst. (Beograd)13 (1972), 39–42.
J. Neŝetřil,On reconstructing of infinite forests, Comment. Univ. Math. Carolinae13 (1972), 503–510.
J. Neŝetřil,On reconstruction of infinite forests II, Comment. Math. Univ. Carolinae, to appear.
Rights and permissions
About this article
Cite this article
Thomassen, C. Reconstructing 1-coherent locally finite trees. Commentarii Mathematici Helvetici 53, 608–612 (1978). https://doi.org/10.1007/BF02566101
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02566101