Explicit Enumeration of Triangulations with Multiple Boundaries

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.

• Type: Journal
• Year: 2007
• Where: COMBINATORICS
• Authors: Maxim Krikun
• Keywords: Boundary Component, COMBINATORICS 2007, Multiple Holes, Total Number