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

DOI10.1007/s00454-009-9149-3zbMath1213.05053WikidataQ59410429 ScholiaQ59410429MaRDI QIDQ848671

Giuseppe Liotta, Hazel Everett, Sylvain Lazard, Stephen K. 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 drawing; universal point sets; one-bend drawings; simultaneous embeddings

Mathematics Subject Classification ID

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

Related Items

A Census of Plane Graphs with Polyline Edges, Plane 3-Trees: Embeddability and Approximation, Computing upward topological book embeddings of upward planar digraphs, Universal point sets for planar three-trees, Orthogeodesic point-set embedding of trees, Orthogeodesic Point-Set Embedding of Trees, On Point-Sets That Support Planar Graphs

Cites Work

• Unnamed Item
• Curve-constrained drawings of planar graphs
• How to draw a planar graph on a grid
• A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs
• On simultaneous planar graph embeddings
• The book thickness of a graph
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine
• Embedding planar graphs at fixed vertex locations