Explicit Enumeration of Triangulations with Multiple Boundaries

  • Maxim Krikun
DOI: https://doi.org/10.37236/979

Abstract

We enumerate rooted triangulations of a sphere with multiple holes by the total number of edges and the length of each boundary component. The proof relies on a combinatorial identity due to W.T. Tutte.

Published
2007-08-27
How to Cite
Krikun, M. (2007). Explicit Enumeration of Triangulations with Multiple Boundaries. The Electronic Journal of Combinatorics, 14(1), R61. https://doi.org/10.37236/979
Issue
Volume 14 (2007)
Article Number
R61