The following pages link to (Q4940023):
Displaying 22 items.
- On the number of crossing-free partitions (Q359753) (← links)
- Counting triangulations of balanced subdivisions of convex polygons (Q510541) (← links)
- Counting triangulations of some classes of subdivided convex polygons (Q518180) (← links)
- On degrees in random triangulations of point sets (Q549246) (← links)
- The enumeration of akempic triangulations (Q1065015) (← links)
- On the numbers of n-tangencies of polygons in odd dimensional Euclidean spaces (Q1107832) (← links)
- Triangulations, visibility graph and reflex vertices of a simple polygon (Q1126249) (← links)
- The number of geometric bistellar neighbors of a triangulation (Q1283745) (← links)
- Asymptotic number of triangulations with vertices in \(\mathbb{Z}^2\) (Q1284484) (← links)
- New counts for the number of triangulations of cyclic polytopes (Q1662246) (← links)
- A better upper bound on the number of triangulations of a planar point set (Q1873821) (← links)
- A lower bound on the number of triangulations of planar point sets (Q1882855) (← links)
- Ears of triangulations and Catalan numbers (Q1910592) (← links)
- Minimum number of partial triangulations (Q2107503) (← links)
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices (Q2207612) (← links)
- A new lower bound on the maximum number of plane graphs using production matrices (Q2331222) (← links)
- Counting triangulations and other crossing-free structures approximately (Q2341692) (← links)
- On the number of pseudo-triangulations of certain point sets (Q2474495) (← links)
- Enumeration of Almost-Convex Polygons on the Square Lattice (Q4019376) (← links)
- (Q4331201) (← links)
- (Q4549006) (← links)
- Orbiting triangle method for convex polygon triangulation (Q5155721) (← links)
