Convex grid drawings of planar graphs with constant edge-vertex resolution
From MaRDI portal
Publication:2169950
DOI10.1007/978-3-031-06678-8_12OpenAlexW4285291047MaRDI QIDQ2169950
Martin Gronemann, Fabrizio Montecchiani, Michael A. Bekos, Antonios Symvonis
Publication date: 30 August 2022
Full work available at URL: https://arxiv.org/abs/2204.14040
Related Items (2)
Strictly-convex drawings of 3-connected planar graphs ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 4-labelings and grid embeddings of plane quadrangulations
- Bold graph drawings
- A linear-time algorithm for drawing a planar graph on a grid
- Closed rectangle-of-influence drawings for irreducible triangulations
- Drawing plane graphs nicely
- A refinement of Kuratowski's theorem
- Strictly convex drawings of planar graphs
- Convex drawings of 3-connected plane graphs
- Open rectangle-of-influence drawings of inner triangulated plane graphs
- Output-sensitive reporting of disjoint paths
- Grid embedding of 4-connected plane graphs
- Drawing planar graphs using the canonical ordering
- Grid drawings of graphs with constant edge-vertex resolution
- Bemerkungen zum Vierfarbenproblem
- Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area
- Drawing Planar Graphs with Large Vertices and Thick Edges
- Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs
- CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS
- DRAWING WITH FAT EDGES
- How to Draw a Graph
- Convex Maps
- Algorithms and Data Structures
- Grid drawings of 4-connected plane graphs
- Convex drawings of planar graphs and the order dimension of 3-polytopes
This page was built for publication: Convex grid drawings of planar graphs with constant edge-vertex resolution
