Explicit enumeration of triangulations with multiple boundaries
The electronic journal of combinatorics, Tome 14 (2007)
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.
@article{10_37236_979,
author = {Maxim Krikun},
title = {Explicit enumeration of triangulations with multiple boundaries},
journal = {The electronic journal of combinatorics},
year = {2007},
volume = {14},
doi = {10.37236/979},
zbl = {1157.05031},
url = {http://geodesic.mathdoc.fr/articles/10.37236/979/}
}
Maxim Krikun. Explicit enumeration of triangulations with multiple boundaries. The electronic journal of combinatorics, Tome 14 (2007). doi: 10.37236/979
Cité par Sources :