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