Pages that link to "Item:Q685602"
From MaRDI portal
The following pages link to One strike against the min-max degree triangulation problem (Q685602):
Displaying 10 items.
- Minimum degree triangulation for rectangular domains (Q1044720) (← links)
- Triangulating a surface with a prescribed graph (Q1325240) (← links)
- Triangulating planar graphs while minimizing the maximum degree (Q1363779) (← links)
- Higher order Delaunay triangulations (Q1614071) (← links)
- Computational complexity of the vertex cover problem in the class of planar triangulations (Q1744983) (← links)
- Profile minimization on triangulated triangles (Q1861244) (← links)
- Plane graphs with parity constraints (Q2441354) (← links)
- Plane Graphs with Parity Constraints (Q3183437) (← links)
- Euler Transformation of Polyhedral Complexes (Q5012872) (← links)
- Augmenting Geometric Graphs with Matchings (Q5014140) (← links)