Abstract
AbstractThe object of this paper is to prove that the following classes of graphs are edge-reconstructible: (i) 4-connected planar graphs with minimum valency 5; (ii) maximal planar graphs with minimum valency at least 4.
Publisher
Cambridge University Press (CUP)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A survey on edge reconstruction of graphs;Journal of Discrete Mathematical Sciences and Cryptography;2002-04
2. On the edge-reconstruction of 3-connected planar graphs with minimum valency 4;Discrete Mathematics;1995-01
3. Edge-reconstruction of minimally 3-connected planar graphs;Aequationes Mathematicae;1994-02
4. Edge-Reconstruction of Graphs With Topological Properties;Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics;1983
5. Edge-reconstruction of 4-connected planar graphs;Journal of Graph Theory;1982