Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference8 articles.
1. A counterexample to the countable version of a conjecture of Ulam;Fisher;J. Combinatorial Theory,1969
2. A simpler counterexample to the Reconstruction Conjecture for denumerable graphs;Fisher;J. Combinatorial Theory,1972
3. Graph Theory;Harary,1969
4. A survey of the Reconstruction Conjecture;Harary,1974
5. On the reconstruction of countable forests;Harary;Publ. Math. Inst.,1972
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献