Pages that link to "Item:Q5056168"

The following pages link to On triangulating planar graphs under the four-connectivity constraint (Q5056168):

Displayed 2 items.

• Triangulating planar graphs while minimizing the maximum degree (Q1363779) ‎ (← links)
• Maximal strip recovery problem with gaps: hardness and approximation algorithms (Q2434927) ‎ (← links)