On Point-Sets That Support Planar Graphs

DOI10.1007/978-3-642-25878-7_7zbMath1311.68111OpenAlexW172962633WikidataQ62042465 ScholiaQ62042465MaRDI QIDQ3223944

David Rappaport, Giuseppe Liotta, Sylvain Lazard, Vida Dujmović, William J. Lenhart, Stephen K. Wismath, William S. Evans

Publication date: 9 March 2012

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25878-7_7

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• 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
• Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
• On simultaneous planar graph embeddings
• On embedding an outer-planar graph in a point set
• The Recognition of Series Parallel Digraphs
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: On Point-Sets That Support Planar Graphs