Universal sets of n points for one-bend drawings of planar graphs with n vertices

DOI10.1007/S00454-009-9149-3MaRDI QIDQ848671zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

graph drawinguniversal point setsone-bend drawingssimultaneous embeddings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

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

• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• A 1.235 lower bound on the number of points needed to draw alln-vertex 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
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• Embedding planar graphs at fixed vertex locations
• How to draw a planar graph on a grid
• On simultaneous planar graph embeddings
• The book thickness of a graph

Cited in

(21)

• 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
• Plane 3-trees: embeddability and approximation
• Upward book embeddability of \(st\)-graphs: complexity and algorithms
• A Census of Plane Graphs with Polyline Edges
• On 1-bend upward point-set embeddings of \(st\)-digraphs
• 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
• 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
• Upward book embeddings of st-graphs
• On point-sets that support planar graphs
• Simultaneous embedding of colored graphs
• 2-colored point-set embeddings of partial 2-trees
• Universal Point Sets for Drawing Planar Graphs with Circular Arcs
• Orthogeodesic point-set embedding of trees
• Small universal point sets for \(k\)-outerplanar graphs
• On point-sets that support planar graphs
• A Note on Universal Point Sets for Planar Graphs

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)