Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference10 articles.
1. On nonreconstructable tournaments;Beineke;J. Combinatorial Theory,1970
2. Graph reconstruction—a survey;Bondy;J. Graph Theory,1977
3. On the reconstruction of a graph from a collection of subgraphs;Harary,1964
4. On the problem of reconstructing a tournament from subtournaments;Harary;Monatsch. Math.,1967
5. Reconstructing the degree pair sequence of a digraph;Manvel;J. Combinatorial Theory Ser. B,1973
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. References;Graphs, Orders, Infinites and Philosophy;2023-03-31
2. The Idiosyncratic Polynomial of Digraphs;Annals of Combinatorics;2022-02-07
3. A property of most of the known non-reconstructible digraphs;AKCE International Journal of Graphs and Combinatorics;2022-01-02
4. Seurat games on Stockmeyer graphs;Journal of Graph Theory;2021-09-24
5. Are all pairs of hypomorphic digraphs S-isomorphic?;Discrete Applied Mathematics;2021-08