Counting 1-vertex Triangulations Of Oriented Surfaces
| dc.creator | Bacher, Roland | |
| dc.creator | Vdovina, Alina | |
| dc.date | 2001-10-02 | |
| dc.date.accessioned | 2026-07-07T04:43:37Z | |
| dc.date.available | 2026-07-07T04:43:37Z | |
| dc.description | A {\em $1-$vertex triangulation} of an oriented compact surface $S$ of genus $g$ is an embedded graph $T\subset S$ with a unique vertex such that all connected components of $S\setminus T$ are triangles (adjacent to exactly 3 edges of $T$). This paper gives formulas enumerating such triangulations (up to equivalence) on an oriented surface of given genus. {\em Une triangulation à un sommet} d'une surface orientée compacte $S$ de genre $g$ est un graphe $T\subset S$ qui a un unique sommet et dont toutes les faces (composantes connexes de $S\setminus T$) sont des triangles (incidentes à trois arêtes de $T$). Cet article donne des formules permettant d'énumérer ces triangulations. | |
| dc.description | 15 pages, 2 figures | |
| dc.identifier | https://arxiv.org/abs/math/0110025 | |
| dc.identifier | http://arxiv.org/abs/math/0110025 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/62300 | |
| dc.subject | Combinatorics | |
| dc.subject | Group Theory | |
| dc.title | Counting 1-vertex Triangulations Of Oriented Surfaces | |
| dc.type | text |