Explicit enumeration of triangulations with multiple boundaries
The electronic journal of combinatorics, Tome 14 (2007)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl arXiv EuDML
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.
DOI : 10.37236/979
Classification : 05C30, 05A19
Maxim Krikun. Explicit enumeration of triangulations with multiple boundaries. The electronic journal of combinatorics, Tome 14 (2007). doi: 10.37236/979
@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/}
}
TY  - JOUR
AU  - Maxim Krikun
TI  - Explicit enumeration of triangulations with multiple boundaries
JO  - The electronic journal of combinatorics
PY  - 2007
VL  - 14
UR  - http://geodesic.mathdoc.fr/articles/10.37236/979/
DO  - 10.37236/979
ID  - 10_37236_979
ER  - 
%0 Journal Article
%A Maxim Krikun
%T Explicit enumeration of triangulations with multiple boundaries
%J The electronic journal of combinatorics
%D 2007
%V 14
%U http://geodesic.mathdoc.fr/articles/10.37236/979/
%R 10.37236/979
%F 10_37236_979

Cité par Sources :