Pages that link to "Item:Q5056146"
From MaRDI portal
The following pages link to Triangulating planar graphs while minimizing the maximum degree (Q5056146):
Displaying 7 items.
- One strike against the min-max degree triangulation problem (Q685602) (← links)
- Optimal 1-planar graphs which triangulate other surfaces (Q1045136) (← links)
- Triangulating planar graphs while minimizing the maximum degree (Q1363779) (← links)
- Computational complexity of the vertex cover problem in the class of planar triangulations (Q1744983) (← links)
- (Q3611292) (← links)
- (Q4414480) (← links)
- Polygon decomposition for efficient construction of Minkowski sums (Q5959553) (← links)