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