Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
type: Item
instance of: scholarly article
title: Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
zbMATH Open document ID: 1235.05097
author: Seok-Hee Hong
author: Hiroshi Nagamochi
published in: Algorithmica
publication date: 2011-12-14T00:00:00Z
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 52B99
zbMATH DE Number: 5988467
zbMATH Keywords: graph drawing
zbMATH Keywords: Steinitz's theorem
zbMATH Keywords: convex drawing
zbMATH Keywords: planar graphs
zbMATH Keywords: biconnected graphs
zbMATH Keywords: triconnected graphs
zbMATH Keywords: polyhedra
zbMATH Keywords: polytopes
zbMATH Keywords: convex polytopes
zbMATH Keywords: non-convex polytopes
zbMATH Keywords: polyhedral graphs
zbMATH Keywords: upward star-shaped polyhedra
zbMATH Keywords: spherical polyhedra
MaRDI profile type: Publication
full work available at URL: s00453-011-9570-x
OpenAlex ID: W2082751635
cites work: ON CONVEX POLYHEDRA IN LOBAČEVSKIĬ SPACES
cites work: Q5589866
cites work: Preassigning the shape of a face
cites work: Puzzles and polytope isomorphisms
cites work: Graph Drawing
cites work: Q3220608
cites work: Rigidity and energy
cites work: Q5672665
cites work: Q3316741
cites work: Q4274573
cites work: On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
cites work: On-Line Planarity Testing
cites work: On-line maintenance of triconnected components with SPQR-trees
cites work: Q3154375
cites work: Non-convex Representations of Graphs
cites work: Polytopes, graphs, and complexes
cites work: Q4225303
cites work: A starshaped polyhedron with no net
cites work: Q4537232
cites work: Graphs of polyhedra; polyhedra as graphs
cites work: Q4472293
cites work: Convex drawings of graphs with non-convex boundary constraints
cites work: Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints
cites work: Upward Star-Shaped Polyhedral Graphs
cites work: Convex drawings of hierarchical planar graphs and clustered planar graphs
cites work: An algorithm for constructing star-shaped drawings of plane graphs
cites work: A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs
cites work: A paradigm for robust geometric algorithms
cites work: Dividing a Graph into Triconnected Components
cites work: On the \(k\)-systems of a simple polytope
cites work: Q4414641
cites work: A simple way to tell a simple polytope from its graph
cites work: Q4866086
cites work: Q4309961
cites work: Q4401007
cites work: Q4871766
cites work: Abstract Regular Polytopes
cites work: CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS
cites work: A polynomial time circle packing algorithm
cites work: Graphs on surfaces
cites work: Embedding 3-polytopes on a small grid
cites work: Cell Complexes, Valuations, and the Euler Relation
cites work: Realization spaces of polytopes
cites work: Drawing 3-Polytopes with Good Vertex Resolution
cites work: Q3216670
cites work: Characteristic numbers of 3-manifolds
cites work: On the delta-wye reduction for planar graphs
cites work: Convex Representations of Graphs
cites work: How to Draw a Graph
cites work: Q3216652
cites work: Q3317673
cites work: Q3321014

Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra (cites work)
cites work: Lectures on Polytopes

Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra (DOI)
DOI: 10.1007/S00453-011-9570-X