Pages that link to "Item:Q1355197"
From MaRDI portal
The following pages link to Grid embedding of 4-connected plane graphs (Q1355197):
Displaying 9 items.
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs (Q834906) (← links)
- Transversal structures on triangulations: A combinatorial study and straight-line drawings (Q1011766) (← links)
- Minimum-width grid drawings of plane graphs (Q1265328) (← links)
- Rectangular grid drawings of plane graphs (Q1392851) (← links)
- Convex grid drawings of planar graphs with constant edge-vertex resolution (Q2169950) (← links)
- Planar polyline drawings via graph transformations (Q2379928) (← links)
- CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS (Q4675884) (← links)
- CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS (Q5493893) (← links)
- Convex grid drawings of planar graphs with constant edge-vertex resolution (Q6199406) (← links)
