Pages that link to "Item:Q1873151"
From MaRDI portal
The following pages link to Tight degree bounds for pseudo-triangulations of points (Q1873151):
Displaying 12 items.
- Multitriangulations, pseudotriangulations and primitive sorting networks (Q443914) (← links)
- Convexity minimizes pseudo-triangulations (Q598549) (← links)
- Pointed binary encompassing trees: simple and optimal (Q733553) (← links)
- Empty pseudo-triangles in point sets (Q765318) (← links)
- On minimum weight pseudo-triangulations (Q924080) (← links)
- A vertex-face assignment for plane graphs (Q1025293) (← links)
- Planar minimally rigid graphs and pseudo-triangulations (Q1775778) (← links)
- On numbers of pseudo-triangulations (Q1947983) (← links)
- Plane graphs with parity constraints (Q2441354) (← links)
- Flip graphs of bounded degree triangulations (Q2637710) (← links)
- Plane Graphs with Parity Constraints (Q3183437) (← links)
- FLIPS IN COMBINATORIAL POINTED PSEUDO-TRIANGULATIONS WITH FACE DEGREE AT MOST FOUR (Q5247062) (← links)