Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference6 articles.
1. Reconstructing infinite graphs;Bondy;Pacific J. Math.,1974
2. Almost reconstructing infinite graphs;Bondy,1974
3. Graph reconstruction—a survey;Bondy;J. Graph Theory,1977
4. A counterexample to the countable version of a conjecture of Ulam;Fisher;J. Combinatorial Theory (B),1972
5. On the reconstruction of countable forests;Harary;Publ. Math. Inst.,1972
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献