Journal ArticleOPEN ACCESS

Explicit enumeration of triangulations with multiple boundaries

Electronic Journal of Combinatorics (2007) 14(1 R)
DOI: 10.37236/979
20Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Krikun, M. (2007). Explicit enumeration of triangulations with multiple boundaries. Electronic Journal of Combinatorics, 14(1 R). https://doi.org/10.37236/979

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free