Generating irreducible triangulations of surfaces

Simple item page
dc.creatorSulanke, Thom
dc.date2006-06-27
dc.date.accessioned2026-07-07T07:17:45Z
dc.date.available2026-07-07T07:17:45Z
dc.descriptionStarting with the irreducible triangulations of a fixed surface and splitting vertices, all the triangulations of the surface up to a given number of vertices can be generated. The irreducible triangulations have previously been determined for the surfaces S_0, S_1, N_1,and N_2. An algorithm is presented for generating the irreducible triangulations of a fixed surface using triangulations of other surfaces. This algorithm has been implemented as a computer program which terminates for S_1, S_2, N_1, N_2, N_3, and N_4. Thus the complete sets irreducible triangulations are now also known for S_2, N_3, and N_4, with respective cardinalities 396784, 9708, and 6297982.
dc.description11 pages
dc.identifierhttps://arxiv.org/abs/math/0606687
dc.identifierhttp://arxiv.org/abs/math/0606687
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/114050
dc.subjectCombinatorics
dc.subject05c30; 05c10
dc.titleGenerating irreducible triangulations of surfaces
dc.typetext

Files

Collections

arXiv