An algorithm that constructs irreducible triangulations of once-punctured surfaces
Combinatorics
2016-10-12 v3
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.
Cite
@article{arxiv.1410.7738,
title = {An algorithm that constructs irreducible triangulations of once-punctured surfaces},
author = {María José Chávez and Serge Lawrencenko and José Ramón Portillo and María Trinidad Villar},
journal= {arXiv preprint arXiv:1410.7738},
year = {2016}
}
Comments
This 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