Drawing planar graphs on 89n^2 area
From MaRDI portal
Publication:5300977
DOI10.1016/J.ENDM.2008.06.005zbMATH Open1267.05173OpenAlexW202496218WikidataQ59410423 ScholiaQ59410423MaRDI QIDQ5300977FDOQ5300977
Publication date: 28 June 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2008.06.005
Recommendations
Cites Work
Cited In (9)
- A Note on Universal Point Sets for Planar Graphs
- Small grid drawings of planar graphs with balanced partition
- Universal point sets for planar three-trees
- Orthogeodesic point-set embedding of trees
- Drawing Planar Graphs with Reduced Height
- A note on universal point sets for planar graphs
- Limitations on realistic hyperbolic graph drawing
- Orthogeodesic Point-Set Embedding of Trees
- Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints
This page was built for publication: Drawing planar graphs on \(\frac{8}{9}n^2\) area
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300977)