Universal sets of n points for one-bend drawings of planar graphs with n vertices
From MaRDI portal
Publication:848671
DOI10.1007/S00454-009-9149-3zbMATH Open1213.05053OpenAlexW2058678665WikidataQ59410429 ScholiaQ59410429MaRDI QIDQ848671FDOQ848671
Authors: Hazel Everett, Sylvain Lazard, Giuseppe Liotta, S. Wismath 
Publication date: 4 March 2010
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-009-9149-3
Recommendations
- Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
- On universal point sets for planar graphs
- On universal point sets for planar graphs
- A note on universal point sets for planar graphs
- A Note on Universal Point Sets for Planar Graphs
- Universal point subsets for planar graphs
- Universal Point Sets for Drawing Planar Graphs with Circular Arcs
- On point set embeddings for \(k\)-planar graphs with few bends per edge
- A universal point set for 2-outerplanar graphs
- Linear-size universal point sets for one-bend drawings
Cites Work
- How to draw a planar graph on a grid
- The book thickness of a graph
- Title not available (Why is that?)
- On simultaneous planar graph embeddings
- Embedding planar graphs at fixed vertex locations
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- Curve-constrained drawings of planar graphs
- Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
Cited In (20)
- A Note on Universal Point Sets for Planar Graphs
- Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
- Plane multigraphs with one-bend and circular-arc edges of a fixed angle
- Universal point sets for planar three-trees
- Orthogeodesic point-set embedding of trees
- On point-sets that support planar graphs
- Small universal point sets for \(k\)-outerplanar graphs
- A Census of Plane Graphs with Polyline Edges
- Linear-size universal point sets for one-bend drawings
- Computing upward topological book embeddings of upward planar digraphs
- On point set embeddings for \(k\)-planar graphs with few bends per edge
- 2-colored point-set embeddings of partial 2-trees
- On point-sets that support planar graphs
- Upward book embeddings of st-graphs
- Simultaneous embedding of colored graphs
- Upward book embeddability of \(st\)-graphs: complexity and algorithms
- Universal Point Sets for Drawing Planar Graphs with Circular Arcs
- Orthogeodesic point-set embedding of trees
- Plane 3-trees: embeddability and approximation
- On 1-bend upward point-set embeddings of \(st\)-digraphs
This page was built for publication: Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848671)
