scientific article; zbMATH DE number 1506432
All the maps considered in this paper are planar maps with a distinguished oriented edge called rooted planar maps. A near-triangulation of the sphere or a disc is a rooted non-separable planar map all whose faces other than possibly the face containing the root edge are triangles. A fair (near-)triangulation has no inner edges parallel to the root edge, and a simple-border (near-)triangulation has no inner edges parallel to the edges of the face containing the root. If \( {\mathcal C} \) is any of the above classes of triangulations, the enumeration problem considered is the problem of finding the coefficients of \[ f(x,y,z) = \sum_{M \in {\mathcal C}} x^{m(M)} y^{s(M)} z^{n(M)} , \] where \( m(M) \), \( s(M) \), and \( n(M) \) are the length of the face of \( M \) containing the root, the number of edges of \( M \), and the number of faces of \( M \), respectively (i.e., the authors are after the number of maps in \( {\mathcal C} \) with a specified length of the face containing the root, number of edges and number of faces). Using the Lagrange inversion together with some recursion methods, the coefficients of \( f(x,y,z) \) are determined for the class of fair near-triangulations, simple-border near triangulations, and fair triangulations.
- Explicit enumeration of triangulations with multiple boundaries
- Counting rooted near-triangulations on the sphere
- On the number of fair triangulations
- Enumeration of rooted planar triangulations with respect to diagonal flips
- Counting 5-connected planar triangulations
- Complex parametrization of triangulations on oriented maps
- scientific article; zbMATH DE number 1829310 (Why is no real title available?)
- scientific article; zbMATH DE number 1567267 (Why is no real title available?)
- scientific article; zbMATH DE number 2213986 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4504840)