A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
From MaRDI portal
(Redirected from Publication:834906)
Recommendations
Cites work
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 3885930 (Why is no real title available?)
- scientific article; zbMATH DE number 3047038 (Why is no real title available?)
- A linear-time algorithm for drawing a planar graph on a grid
- Bemerkungen zum Vierfarbenproblem
- Convex Maps
- Drawing plane graphs nicely
- Grid embedding of 4-connected plane graphs
- How to draw a planar graph on a grid
Cited in
(14)- Upward Straight-Line Embeddings of Directed Graphs into Point Sets
- A Note on Universal Point Sets for Planar Graphs
- Upward straight-line embeddings of directed graphs into point sets
- Universal point sets for planar three-trees
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
- An exponential bound for simultaneous embeddings of planar graphs
- Small point sets for simply-nested planar graphs
- Small universal point sets for \(k\)-outerplanar graphs
- On point-sets that support planar graphs
- A note on universal point sets for planar graphs
- Drawing \(K_{2,n}\): A lower bound
- Orthogeodesic point-set embedding of trees
- Universal geometric graphs
- Plane 3-trees: embeddability and approximation
This page was built for publication: A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834906)
