ON THE EDGE RECONSTRUCTION OF GRAPHS EMBEDDED IN SURFACES II.

In this paper, we prove the following theorems. (i) Let G be a graph of minimum degree ´e5. If G is embeddable in a surface à and satisfies (´-5)#V(G)#+6Ç(Ã)e0, then G is edge reconstructible. (ii) Any graph of minimum degree 4 that triangulates a surface is edge reconstructible. (iii) Any graph which triangulates a surface of characteristic Çe0 is edge reconstructible. [ABSTRACT FROM AUTHOR]