Pages that link to "Item:Q1866981"
From MaRDI portal
The following pages link to Embeddings of planar graphs that minimize the number of long-face cycles (Q1866981):
Displaying 6 items.
- On the complexity of embedding planar graphs to minimize certain distance measures (Q582079) (← links)
- Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations (Q2867674) (← links)
- Planar Embeddings with Small and Uniform Faces (Q2942666) (← links)
- Minimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph (Q3143738) (← links)
- Approximation Algorithms for Facial Cycles in Planar Embeddings (Q5091033) (← links)
- Graph Drawing (Q5897617) (← links)
