Enumeration of Triangulations of the Disk
From MaRDI portal
Publication:5344764
DOI10.1112/PLMS/S3-14.4.746zbMATH Open0134.19503OpenAlexW2052888479MaRDI QIDQ5344764FDOQ5344764
Authors: William G. Brown
Publication date: 1964
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/plms/s3-14.4.746
Cited In (41)
- On the existence of square roots in certain rings of power series
- A survey of the asymptotic behaviour of maps
- The number of loopless planar maps
- Enumeration of rooted 4-regular maps without planar loops
- On the enumeration of convex polyhedra
- A bijection for triangulations, quadrangulations, pentagulations, etc.
- Pants decompositions of random surfaces
- Supereigenvalue models and topological recursion
- Random cubic planar graphs converge to the Brownian sphere
- The number of rooted triangular maps on a surface
- Enumeration of \(r\)-regular maps on the torus. I: Rooted maps on the torus, the projective plane and the Klein bottle. Sensed maps on the torus
- Uniform infinite planar triangulations
- Bijections for planar maps with boundaries
- Catalan triangulations of the Möbius band
- Scaling limit of triangulations of polygons
- Topological recursion in the Ramond sector
- Counting rooted unicursal planar maps
- Brown's theorem and its application for enumeration of dissections and planar trees
- On symmetric quadrangulations and triangulations
- Exact enumeration of rooted 3-connected triangular maps on the projective plane
- On acyclic simplicial complexes
- First-passage percolation on random simple triangulations
- Enumerating rooted loopless planar maps
- The distribution of the maximum vertex degree in random planar maps
- Transversal structures on triangulations: A combinatorial study and straight-line drawings
- Counting 5-connected planar triangulations
- Enumeration of rooted planar triangulations with respect to diagonal flips
- The combinatorics of a tree-like functional equation for connected chord diagrams
- Generating rooted triangulations without repetitions
- A classification of plane and planar 2-trees
- Counting symmetry classes of dissections of a convex regular polygon
- Enumeration des graphes planaires à l'aide des séries formelles en variables non commutatives
- Hausdorff moment problem for combinatorial numbers of Brown and Tutte: exact solution
- Fast Algorithms for Discrete Differential Equations
- The asymptotic behaviour of the number of three-connected triangulations of the disk, with a reflective symmetry in a line
- Minimum weight disk triangulations and fillings
- Combinatorial trees arising in the study of interval exchange transformations
- The geometry of flip graphs and mapping class groups
- Cubic graphs and related triangulations on orientable surfaces
- Polynomial equations with one catalytic variable, algebraic series and map enumeration
- Counting equivalence classes of vertex pairs modulo the dihedral action on the associahedron
This page was built for publication: Enumeration of Triangulations of the Disk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5344764)