Grid embedding of 4-connected plane graphs

DOI10.1007/PL00009290zbMath0877.05014MaRDI QIDQ1355197

Xin He

Publication date: 8 December 1997

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

planar graphgraph drawinggrid embeddinggrid representation

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (10)

A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs ⋮ Planar polyline drawings via graph transformations ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ Rectangular grid drawings of plane graphs ⋮ Strictly-convex drawings of 3-connected planar graphs ⋮ CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ Transversal structures on triangulations: A combinatorial study and straight-line drawings ⋮ Minimum-width grid drawings of plane graphs ⋮ CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS

Cites Work

• A linear-time algorithm for drawing a planar graph on a grid
• How to draw a planar graph on a grid
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Planar graphs and poset dimension
• Algorithms for drawing graphs: An annotated bibliography
• Bemerkungen zum Vierfarbenproblem
• Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs
• How to Draw a Graph
• Convex Maps
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Grid embedding of 4-connected plane graphs