Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
DOI10.1007/978-3-540-77537-9_34zbMATH Open1137.68482DBLPconf/gd/EverettLLW07OpenAlexW1563721641WikidataQ62042569 ScholiaQ62042569MaRDI QIDQ5452237FDOQ5452237
Authors: Hazel Everett, Sylvain Lazard, Giuseppe Liotta, S. Wismath
Publication date: 25 March 2008
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77537-9_34
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (6)
- Simultaneous graph embedding with bends and circular arcs
- A Note on Universal Point Sets for Planar Graphs
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
- On point-sets that support planar graphs
- On point-sets that support planar graphs
- Universal Point Sets for Drawing Planar Graphs with Circular Arcs
This page was built for publication: Universal Sets of n Points for 1-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 Q5452237)