Improving the minimum-height grid drawings of plane graphs.

MaRDI QIDQ3183008zbMATH OpenFDO

Authors Ahmad A. A. Radwan, Marek Chrobak

Publication date 16 October 2009

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Minimum-width grid drawings of plane graphs
• Minimum-area drawings of plane 3-trees
• Rectangular grid drawings of plane graphs
• How to draw a planar graph on a grid
• Grid drawings of 4-connected plane graphs

Cited in

(8)

• Minimum-width grid drawings of plane graphs
• Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity
• Homotopy height, grid-major height and graph-drawing height
• Minimum-area drawings of plane 3-trees
• scientific article; zbMATH DE number 2069509 (Why is no real title available?)
• A Note on Minimum-Area Straight-Line Drawings of Planar Graphs
• Drawing Planar Graphs with Reduced Height
• A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs

This page was built for publication: Improving the minimum-height grid drawings of plane graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183008)