Pages that link to "Item:Q5493893"
From MaRDI portal
The following pages link to CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS (Q5493893):
Displaying 9 items.
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints (Q442281) (← links)
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra (Q652524) (← links)
- Convex drawings of graphs with non-convex boundary constraints (Q947122) (← links)
- Convex drawings of hierarchical planar graphs and clustered planar graphs (Q988690) (← links)
- An algorithm for constructing star-shaped drawings of plane graphs (Q1037784) (← links)
- Convex grid drawings of planar graphs with constant edge-vertex resolution (Q2169950) (← links)
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners (Q2428681) (← links)
- A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs (Q5961977) (← links)
- Convex grid drawings of planar graphs with constant edge-vertex resolution (Q6199406) (← links)
