[1] |
Fisher, J., A counterexample to the countable version of a conjecture of Ulam, J. Combinatorial Theory, 7, 364-365 (1969) · Zbl 0187.21304 |
[2] |
Fisher, J.; Graham, R. L.; Harary, F., A simpler counterexample to the Reconstruction Conjecture for denumerable graphs, J. Combinatorial Theory, 12(B), 203-204 (1972) · Zbl 0229.05140 |
[3] |
Harary, F., Graph Theory (1969), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0797.05064 |
[4] |
Harary, F., A survey of the Reconstruction Conjecture, (Bari, R.; Harary, F., Graphs and Combinatorics (1974), Springer: Springer Berlin) · Zbl 0293.05152 |
[5] |
Harary, F.; Schwenk, A. J.; Scott, R. I., On the reconstruction of countable forests, Publ. Math. Inst., 13, 39-42 (1972), (Beograd) · Zbl 0242.05101 |
[6] |
Lovász, L., A note on the line reconstruction problem, J. Combinatorial Theory Ser. B, 13, 309-310 (1972) · Zbl 0244.05112 |
[7] |
Muller, V., The Edge Reconstruction Hypothesis is true for graphs with more than \(n\) log \(n\) edges, J. Combinatorial Theory Ser. B, 22, 281-283 (1977) · Zbl 0344.05161 |
[8] |
Stockmeyer, P. K., The falsity of the Reconstruction Conjecture for tournaments, J. Graph. Theory, 1, 19-25 (1977) · Zbl 0355.05026 |