Realizing planar graphs as convex polytopes
From MaRDI portal
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Recommendations
Cites work
- A quantitative Steinitz' theorem
- Convex Representations of Graphs
- Existence and uniqueness of packings with specified combinatorics
- Geometric and combinatorial structures on graphs
- How to Draw a Graph
- scientific article; zbMATH DE number 3851896 (Why is no real title available?)
- scientific article; zbMATH DE number 3791613 (Why is no real title available?)
- On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
- On the maximal number of edges of convex digital polygons included into an m m-grid
- On the number of spanning trees a planar graph can have
- Realization spaces of polytopes
- Small grid embeddings of 3-polytopes
- Steinitz representations of polyhedra and the Colin de Verdière number
- Strictly convex drawings of planar graphs
Cited in
(6)- A quantitative Steinitz' theorem
- A polyhedron full of surprises
- Constructing convex 3-polytopes from two triangulations of a polygon
- Polyhedral realization as deltahedra using subgraph isomorphism test
- Polyhedral realization as deltahedra using the subgraph isomorphism test
- A realization of graph associahedra
This page was built for publication: Realizing planar graphs as convex polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3223957)
