Free edge lengths in plane graphs
From MaRDI portal
Publication:2354683
DOI10.1007/s00454-015-9704-zzbMath1317.05033OpenAlexW1762833411MaRDI QIDQ2354683
Csaba D. Tóth, Filip Morić, Sarah Eisenstat, Tibor Szabó, Radoslav Fulek, Yoshio Okamoto, Robert Connelly, Zachary R. Abel
Publication date: 20 July 2015
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/106900
Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- How to draw a planar graph on a grid
- Convex drawings of graphs with non-convex boundary constraints
- Reconfiguring closed polygonal chains in Euclidean \(d\)-space
- Straightening polygonal arcs and convexifying polygonal cycles
- Connected rigidity matroids and unique realizations of graphs
- Fixed edge-length graph drawing is NP-hard
- A Kuratowski-type theorem for planarity of partially embedded graphs
- Generic global rigidity
- Angles of Planar Triangular Graphs
- Distance Sets of Urysohn Metric Spaces
- Testing Planarity of Partially Embedded Graphs
- Morphing Planar Graph Drawings Optimally
- Planar Embeddings of Graphs with Specified Edge Lengths
- A Note on Minimum-Area Straight-Line Drawings of Planar Graphs
- ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING
- SOFSEM 2005: Theory and Practice of Computer Science
- How to Draw a Graph
- Unnamed Item
- Unnamed Item
This page was built for publication: Free edge lengths in plane graphs
