Counting 1-vertex triangulations of oriented surfaces

From MaRDI portal



Abstract: A {em 1−vertex triangulation} of an oriented compact surface S of genus g is an embedded graph TsubsetS with a unique vertex such that all connected components of SsetminusT 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 `a un sommet} d'une surface orient'ee compacte S de genre g est un graphe TsubsetS qui a un unique sommet et dont toutes les faces (composantes connexes de SsetminusT) sont des triangles (incidentes `a trois ar^etes de T). Cet article donne des formules permettant denum'erer ces triangulations.












This page was built for publication: Counting 1-vertex triangulations of oriented surfaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348137)