On the Edge Reconstruction of Graphs Embedded in Surfaces II

In this paper, we prove the following theorems. (i) Let G bea graph of minimum degree 5. If G is embeddable in a surface and satisfies (–5)|V(G)|+6()0, then G is edge reconstructible.(ii) Any graph of minimum degree 4 that triangulates a surfaceis edge reconstructible. (iii) Any graph which triangulatesa surface of characteristic 0 is edge reconstructible.