Note on the Edge Reconstruction of Planar Graphs

Abstract

In this paper, we prove that if $G$ is a 3-connected planar graph and contains no vertex of degree $4$, then $G$ is edge reconstructible. This generalizes a result of J. Lauri [J1].