Publisher
Springer Science and Business Media LLC
Reference6 articles.
1. C. D.Godsil, I.Krasikov and Y.Roditty, Reconstructing graphs from theirk-edge deleted subgraphs. J. Combin. Theory (B) (to appear).
2. E.Harary, On the reconstruction of a graph from a collection of subgraphs. In: Theory of Graphs and its Applications, edited by M. Fiedler, Czechoslovak Academy of Sciences, Prague 47?52 (1964).
3. L. LovÁsz, A note on the line reconstruction problem. J. Combin. Theory13, 309?310 (1972).
4. V. Müller, The edge reconstruction conjecture is true for graphs with more thann log 2 n edges. J. Combin. Theory (B)22, 281?283 (1977).
5. R. P. Stanley, Reconstruction from vertex switching. J. Combin. Theory (B)38, 132?138 (1985).
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Group Actions on Boolean Algebras;Undergraduate Texts in Mathematics;2018
2. Group Actions on Boolean Algebras;Undergraduate Texts in Mathematics;2013
3. Switching reconstruction of digraphs;Journal of Graph Theory;2011-02-09
4. Finite-type invariants for graphs and graph reconstructions;Advances in Mathematics;2004-08
5. A survey on edge reconstruction of graphs;Journal of Discrete Mathematical Sciences and Cryptography;2002-04