A triangulation is a rooted planar map all of whose faces are 3-gons. A triangulation is called fair if it has no loop and the root-edge is not part of a multiple edge. This paper gives a formula for the number of fair triangulations with \(3m\) edges and uses this formula to enumerate several other kinds of triangulations.
Recommendations
Cites work
- A Census of Planar Maps
- Counting rooted near-triangulations on the sphere
- Counting Rooted Triangulations
- Enumeration of Rooted Triangular Maps
- scientific article; zbMATH DE number 1739744 (Why is no real title available?)
- On Counting Rooted Triangular Maps
- On functional equations arising from map enumerations
- On the enumeration of non-planar maps
Cited in
(7)- Explicit enumeration of triangulations with multiple boundaries
- Symmetries of unlabelled planar triangulations
- A bijection for triangulations of a polygon with interior points and multiple edges
- scientific article; zbMATH DE number 1829310 (Why is no real title available?)
- scientific article; zbMATH DE number 4063123 (Why is no real title available?)
- scientific article; zbMATH DE number 1506432 (Why is no real title available?)
- scientific article; zbMATH DE number 2213986 (Why is no real title available?)
This page was built for publication: On the number of fair triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569955)
