An algorithm that constructs irreducible triangulations of once-punctured surfaces

Abstract

A triangulation of a surface is irreducible if there is no edge whose contraction produces another triangulation of the surface. In this work we propose an algorithm that constructs the set of irreducible triangulations of any surface with precisely one boundary component. By implementing the algorithm on computer, we have found a list of 297 nonisomorphic combinatorial types of irreducible triangulations on the once-punctured torus.

arXiv commentThis paper is based on my lecture given at University of Seville on 22nd May 2012, http://www.imus.us.es/images/stories/Actividades/2012/SEM_GT_05-22.pdf However, this paper was published without my permission

Cited by in corpus (1)

• Generating families of surface triangulations. The case of punctured surfaces with inner degree at least 4