Counting 1-vertex triangulations of oriented surfaces
From MaRDI portal
Abstract: A {em vertex triangulation} of an oriented compact surface of genus is an embedded graph with a unique vertex such that all connected components of are triangles (adjacent to exactly 3 edges of ). 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 de genre est un graphe qui a un unique sommet et dont toutes les faces (composantes connexes de ) sont des triangles (incidentes `a trois ar^etes de ). Cet article donne des formules permettant denum'erer ces triangulations.
Recommendations
Cited in
(17)- Enumeration of regular maps on surfaces of a given genus
- Genus of two extremal surfaces: Extremal discs, isometries and Weierstrass points
- The diameter of random Belyĭ surfaces
- Systole and inradius of noncompact hyperbolic manifolds
- Counting alternating knots by genus
- Decomposition and Enumeration of Triangulated Surfaces
- scientific article; zbMATH DE number 714724 (Why is no real title available?)
- On the vertex-face graphs of triangulations
- Low complexity algorithms in knot theory
- A theorem on graph embedding with a relation to hyperbolic volume
- Counting geodesics of given commutator length
- Multiple Extremal Disc-Packings in Compact Hyperbolic Surfaces
- Enumerating simplicial decompositions of surfaces with boundaries
- A new combinatorial identity for unicellular maps, via a direct bijective approach
- Square-free words as products of commutators.
- The structure of unicellular maps, and a connection between maps of positive genus and planar labelled trees
- An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
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)