The following pages link to Happy endings for flip graphs (Q2968066):
Displaying 18 items.
- Every large point set contains many collinear points or an empty pentagon (Q659671) (← links)
- Flip distance between triangulations of a simple polygon is NP-complete (Q894685) (← links)
- Flip distance between two triangulations of a point set is NP-complete (Q906837) (← links)
- Flips in planar graphs (Q950400) (← links)
- Flipping edge-labelled triangulations (Q1699301) (← links)
- Correction to: ``Geometry of log-concave density estimation'' (Q2167321) (← links)
- Random lattice triangulations: structure and algorithms (Q2346085) (← links)
- A proof of the orbit conjecture for flipping edge-labelled triangulations (Q2415384) (← links)
- Flip distance between triangulations of a planar point set is APX-hard (Q2444311) (← links)
- Triangulations without pointed spanning trees (Q2479476) (← links)
- Flip graphs of bounded degree triangulations (Q2637710) (← links)
- Happy endings for flip graphs (Q2968066) (← links)
- (Q3602858) (redirect page) (← links)
- Rainbow Cycles in Flip Graphs. (Q5115806) (← links)
- Rainbow Cycles in Flip Graphs (Q5208641) (← links)
- Eccentricities in the flip‐graphs of convex polygons (Q5241608) (← links)
- Flip paths between lattice triangulations (Q6090067) (← links)
- The rotation distance of brooms (Q6201876) (← links)