Nonisomorphic complete triangulations of a surface (Q5937441)

\textit{S. Lawrencenko}, \textit{S. Negami} and the reviewer [Discrete Math. 135, No. 1-3, 367-369 (1994; Zbl 0823.05027)] found three nonisomorphic triangulations of \(K_{19}\) on the orientable surface of genus 20. The present authors show that the minimum order for nonisomorphic triangular imbeddings of complete graphs is 9 for the nonorientable case (with exactly one pair; one imbedding is face-2-colorable, the other is not) and 12 for the orientable case, and that there are 14 nonisomorphic nonorientable triangulations by \(K_{10}\) (including one with symmetry group \(A_5\)). They also construct an infinite family of nonisomorphic nonorientable examples. Two infinite families of nonisomorphic orientable face 2-colorable examples have been constructed by Bonnington, Grannell, Griggs and Širáň [J. Comb. Theory, Ser. B, in preparation].