Ears of triangulations and Catalan numbe
โ
F. Hurtado; M. Noy
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 232 KB
It is known that a convex polygon of n sides admits C.-2 triangulations, where C, is a Catalan number. We classify these triangulations (considered as outerplanar graphs) according to their dual trees, and prove the following formula for the number of triangulations of a convex n-gon whose dual tree