CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS
From MaRDI portal
(Redirected from CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS)
Recommendations
- scientific article; zbMATH DE number 2080251
- scientific article; zbMATH DE number 1500679
- Grid drawings of 4-connected plane graphs
- Convex Grid Drawings of Plane Graphs with Rectangular Contours
- Convex Grid Drawings of Plane Graphs with Rectangular Contours
- Grid embedding of 4-connected plane graphs
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- Convex drawings of 3-connected plane graphs
- Graph Drawing
Cites work
- A linear-time algorithm for drawing a planar graph on a grid
- A linear-time algorithm for four-partitioning four-connected planar graphs
- Drawing planar graphs using the canonical ordering
- Grid drawings of 4-connected plane graphs
- Grid embedding of 4-connected plane graphs
- How to draw a planar graph on a grid
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
Cited in
(18)- An algorithm for constructing star-shaped drawings of plane graphs
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners
- Convex drawings of internally triconnected plane graphs on \(O(n^{2})\) grids
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
- scientific article; zbMATH DE number 2080251 (Why is no real title available?)
- scientific article; zbMATH DE number 1500679 (Why is no real title available?)
- 4-connected triangulations on few lines
- Convex Grid Drawings of Plane Graphs with Rectangular Contours
- Convex Grid Drawings of Plane Graphs with Rectangular Contours
- scientific article; zbMATH DE number 2234520 (Why is no real title available?)
- Grid drawings of 4-connected plane graphs
- A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
- Convex drawings of 3-connected plane graphs
- Convex drawings of graphs with non-convex boundary constraints
- Convex drawings of hierarchical planar graphs and clustered planar graphs
This page was built for publication: CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5493893)