Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Reference10 articles.
1. Graphs and Hypergraphs. North-Holland, Amsterdam and London (1973).
2. Relative lengths of paths and cycles in 3-connected graphs
3. Simple paths on convex polyhedra
4. and , Edge reconstruction of graphs with topological properties. Annals of Disrete Mathematics, Vol. 17, North-Holland, Amsterdam, (1983) 285–288.
5. A shortness exponent forr-regularr-connected graphs
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Reconstruction Problem;Discrete Mathematics and Its Applications;2013-11-26
2. The Reconstructibility of Finite Abelian Groups;Combinatorics, Probability and Computing;2004-11
3. Upper bounds on the automorphism group of a graph0;Discrete Mathematics;2002-09
4. A survey on edge reconstruction of graphs;Journal of Discrete Mathematical Sciences and Cryptography;2002-04
5. Dense graphs and edge reconstruction;Combinatorica;1996-12