On the edge reconstruction of graphs embedded in surfaces. III (Q1127882)

[For Part I see Graphs Comb. 9, No. 4, 391-395 (1993; Zbl 0786.05062), and for Part II see J. Lond. Math. Soc., II. Ser. 57, No. 2, 268-274 (1998; Zbl 0922.05037).] In this paper, we prove that if a connected graph \(G\) embedded in a surface \(S\) of characteristic \( c(S)\) satisfies (1) the minimum degree of \(G \geq 5\) and (2) \(|V(G)|\geq -43c(S)\), then \(G\) is edge reconstructible. A direct consequence of the above result is that a triangulation \(G\) of a surface \(S\) of characteristic \( c(S)\) is edge reconstructible if \(|V(G)|\geq -43c(S)\).