scientific article; zbMATH DE number 3509333
From MaRDI portal
Publication:4089424
zbMATH Open0325.52001MaRDI QIDQ4089424FDOQ4089424
Authors: Ernst Steinitz, Hans A. Rademacher 
Publication date: 1976
Title of this publication is not available (Why is that?)
Polytopes and polyhedra (52Bxx) Projective analytic geometry (51N15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to geometry (51-01) Real and complex geometry (51M99) History of convex and discrete geometry (52-03) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to convex and discrete geometry (52-01)
Cited In (89)
- Construction of planar triangulations with minimum degree 5
- Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers
- Two ``simple 3-spheres
- Ununfoldable polyhedra with convex faces
- An enduring error
- On the enumeration of polyhedra
- An upper bound for the diameter of a polytope
- The enumeration of four-dimensional polytopes
- An impediment to polyhedrality
- Decomposition theorems for the torus, projective plane and Klein bottle
- A FLAG VECTOR OF A 3‐SPHERE THAT IS NOT THE FLAG VECTOR OF A 4‐POLYTOPE
- On generating planar graphs
- Generating even triangulations on the torus
- On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
- Hamiltonian circuits in polytopes with even sided faces
- Generating planar 4-connected graphs
- Which nonnegative matrices are slack matrices?
- On the Topology and Geometric Construction of Oriented Matroids and Convex Polytopes
- Circular planar graphs and resistor networks
- On a conjecture by B. Grünbaum
- Edge reductions in cyclically \(k\)-connected cubic graphs
- A Mihalisin-Klee theorem for fans
- Steinitz' theorem analogue for two-dimensional Cohen-Macaulay complexes
- A linear-time algorithm for drawing a planar graph on a grid
- Drawing polytopal graphs with {\texttt{polymake}}
- Variational principles for circle patterns and Koebe’s theorem
- Inner diagonals of convex polytopes
- ON THE DIMENSIONS OF THE REALIZATION SPACES OF POLYTOPES
- An inductive definition of the class of 3-connected quadrangulations of the plane
- Minor relations for quadrangulations on the sphere
- Area requirement and symmetry display of planar upward drawings
- The existence of certain planar maps
- The triangulations of the 3-sphere with up to 8 vertices
- On the noninterpolation of polyhedral maps
- Advances in the theory and practice of graph drawing
- Equifacetted 3-spheres as topes of nonpolytopal matroid polytopes
- Reconfiguring convex polygons
- Drawing the planar dual
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Small $f$-vectors of 3-spheres and of 4-polytopes
- Polyhedral embeddings in the projective plane
- Flippable edges in triangulations on surfaces
- Diagonal flips in triangulations on closed surfaces with minimum degree at least 4
- Hamiltonian circuits in prisms over certain simple 3-polytopes
- On weakly neighborly polyhedral maps of arbitrary genus
- \(W_ v\) paths in the projective plane
- A Schur's theorem via a monotonicity and the expansion module
- Polytopes of constant weight
- All 2-manifolds have finitely many minimal triangulations
- Incremental convex planarity testing
- Graphs of polyhedra; polyhedra as graphs
- Irreducible triangulations of surfaces with boundary
- Recent trends in combinatorial optimization
- Realization spaces of 4-polytopes are universal
- Generating the 4-connected and strongly 4-connected triangulations on the torus and projective plane
- Untangling planar curves
- Generating maps on surfaces
- All orientable 2-manifolds have finitely many minimal triangulations
- Decompositions of homology manifolds and their graphs
- Every simple 3-polytype with 34 vertices is Hamiltonian
- Generating projective plane polyhedral maps
- Upward planar drawings on the standing and the rolling cylinders
- Rao's theorem for forcibly planar sequences revisited
- On smallest 3-polytopes of given graph radius
- On the configurations of the singular points and their topological indices for the spatial quadratic polynomial differential systems
- A Lagrangian filling for every cluster seed
- A generating theorem of simple even triangulations with a finitizable set of reductions
- An analogue of a theorem of Steinitz for ball polyhedra in \(\mathbb{R}^3\)
- Which graphs are rigid in \(\ell_p^d\)?
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
- Forty Years of Model-Based Phylogeography
- Facial rainbow edge-coloring of simple 3-connected plane graphs
- Straight-line drawings of 1-planar graphs
- Fukaya categories of surfaces, spherical objects and mapping class groups
- Crossing edge minimization in radial outerplanar layered graphs using segment paths
- On-line convex planarity testing
- On unigraphic polyhedra with one vertex of degree \({p-2}\)
- Generating even triangulations on the Klein bottle
- On the complexity of approximating and illuminating three-dimensional convex polyhedra
- Convex grid drawings of planar graphs with constant edge-vertex resolution
- Hyperideal polyhedra in the 3-dimensional anti-de Sitter space
- A new note on 1-planar graphs with minimum degree 7
- Closed 2-cell embeddings in the projective plane
- Irreducible triangulations of the once-punctured torus
- Finitizable set of reductions for polyhedral quadrangulations of closed surfaces
- Combining realization space models of polytopes
- Centering koebe polyhedra via Möbius transformations
- Generating closed 2-cell embeddings in the torus and the projective plane
- Characterization of \((m, n)\)-linked planar graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4089424)
