CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS
From MaRDI portal
Publication:5493893
DOI10.1142/S012905410600425XzbMath1103.68098MaRDI QIDQ5493893
Takao Nishizeki, Kazuyuki Miura, Shin-ichi Nakano
Publication date: 16 October 2006
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Related Items (9)
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 ⋮ Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints ⋮ Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra ⋮ Convex drawings of graphs with non-convex boundary constraints ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ Convex drawings of hierarchical planar graphs and clustered planar graphs ⋮ A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs ⋮ An algorithm for constructing star-shaped drawings of plane graphs
Cites Work
- A linear-time algorithm for four-partitioning four-connected planar graphs
- A linear-time algorithm for drawing a planar graph on a grid
- How to draw a planar graph on a grid
- Grid embedding of 4-connected plane graphs
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- Drawing planar graphs using the canonical ordering
- Grid drawings of 4-connected plane graphs
This page was built for publication: CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS
