×

Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs. (English) Zbl 0493.05045


MSC:

05C60 Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Andreae, Th, Reconstructing the degree sequence and the number of components of an infinite graph, Discrete Math., 39, 1-7 (1982) · Zbl 0449.05051
[2] Andreae, Th, Note on the reconstruction of finite graphs with a fixed finite number of components, J. Graph Theory, 6, 81-83 (1982) · Zbl 0449.05050
[3] Bondy, J. A.; Hemminger, R. L., Graph reconstruction—A survey, J. Graph Theory, 1, 227-268 (1977) · Zbl 0375.05040
[4] Fisher, J., A counterexample to the countable version of a conjecture of Ulam, J. Combin. Theory, 7, 364-365 (1969) · Zbl 0187.21304
[5] Fisher, J.; Graham, R. L.; Harary, F., A simpler counterexample to the reconstruction conjecture for denumerable graphs, J. Combin. Theory Ser. B, 12, 203-204 (1972) · Zbl 0229.05140
[6] Harary, F.; Schwenk, A. J.; Scott, R. L., On the reconstruction of countable forests, Publ. Inst. Math. (Beograd), 13, 39-42 (1972) · Zbl 0242.05101
[7] Nash-Williams, C. St. J.A, The reconstruction problem, (Beineke, L. W.; Wilson, R. J., Selected Topics in Graph Theory (1978), Academic Press: Academic Press New York/London) · Zbl 0433.05045
[8] Nešetřil, J., On reconstructing of infinite forests, Comment. Math. Univ. Carolin., 13, 503-510 (1972) · Zbl 0242.05102
[9] Thomassen, C., Counterexamples to the edge reconstruction conjecture for infinite graphs, Discrete Math., 19, 293-295 (1977) · Zbl 0405.05048
[10] Thomassen, C., Reconstructibility versus edge reconstructibility of infinite graphs, Discrete Math., 24, 231-233 (1978) · Zbl 0391.05041
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.