On point-sets that support planar graphs
DOI10.1016/J.COMGEO.2012.03.003zbMATH Open1251.05038OpenAlexW2168580558WikidataQ62042428 ScholiaQ62042428MaRDI QIDQ714901FDOQ714901
Sylvain Lazard, S. Wismath, David Rappaport, Vida Dujmović, Giuseppe Liotta, William Lenhart, W. Evans
Publication date: 12 October 2012
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2012.03.003
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
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (8)
- A Note on Universal Point Sets for Planar Graphs
- Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
- Universal point sets for planar three-trees
- Small universal point sets for \(k\)-outerplanar graphs
- 1-bend upward planar slope number of SP-digraphs
- Plane 3-Trees: Embeddability and Approximation
- Area requirement of graph drawings with few crossings per edge
- On 1-bend upward point-set embeddings of \(st\)-digraphs
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)
