Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference7 articles.
1. The reconstruction of separable graphs with 2-connected trunks that are series-parallel networks;Anacker;Discrete Math.,1988
2. Graph theory with applications;Bondy,1976
3. On the reconstruction of graphs from a collection of subgraphs;Harary,1964
4. Edge-reconstruction of planar graph with minimum valency 5;Lauri;J. Graph Theory,1979
5. Fixing subgraphs and Ulam's conjecture;Sheehan;J. Combin. Theory Ser. B,1973
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Fixed Edges and Edge-Reconstruction of Series-Parallel Networks;Graphs and Combinatorics;2001-06
2. Almost every graph has a fixed edge;Chinese Science Bulletin;1998-01
3. On fixed edges and edge-reconstruction of series-parallel networks;IEEE. APCCAS 1998. 1998 IEEE Asia-Pacific Conference on Circuits and Systems. Microelectronics and Integrating Systems. Proceedings (Cat. No.98EX242)