EDGE RECONSTRUCTION OF PLANAR GRAPHS WITH MINIMUM DEGREE AT LEAST THREE-(III)
Fan Hongbing · 1994
The object of this series of papers is to show that every planar graph of minimum degree at least 3 is edge reconstructible. In this paper, we prove that 3-connected planar graphs with minimum degree 3 and with each of their 3-vertex deleted subgraphs being 3-connected, are edge reconstructible.