EDGE RECONSTRUCTION OF PLANAR GRAPHS WITH MINIMUM DEGREE AT LEAST THREE-(Ⅰ)

摘要

The object of this series of papers is to show that every planar graph ofminimum degree at least 3 is edge reconstructible. In this paper, we prove that such agraph with connectivity 2 is edge reconstructible.