On point-sets that support planar graphs
From MaRDI portal
Recommendations
- On point-sets that support planar graphs
- Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
- Linear-size universal point sets for one-bend drawings
- Universal point subsets for planar graphs
Cited in
(13)- Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
- Linear size universal point sets for classes of planar graphs
- Area requirement of graph drawings with few crossings per edge
- Plane 3-trees: embeddability and approximation
- On 1-bend upward point-set embeddings of \(st\)-digraphs
- Linear-size universal point sets for one-bend drawings
- On graphs supported by line sets
- Universal point sets for planar three-trees
- Universal line-sets for drawing planar 3-trees
- Small universal point sets for \(k\)-outerplanar graphs
- 1-bend upward planar slope number of SP-digraphs
- On point-sets that support planar graphs
- A Note on Universal Point Sets for Planar Graphs
This page was built for publication: On point-sets that support planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714901)