On the graph structure of convex polyhedra in \(n\)-space

DOI10.2140/PJM.1961.11.431zbMath0103.39602OpenAlexW2086256358WikidataQ29400888 ScholiaQ29400888MaRDI QIDQ774915

No author found.

Publication date: 1961

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1961.11.431

zbMATH Keywords

topology

Related Items (55)

n-connectedness in pure 2-complexes ⋮ A short proof of the \(d\)-connectedness of \(d\)-polytopes ⋮ Linkages in Polytope Graphs ⋮ Cutting a polytope ⋮ On the graph connectivity of skeleta of convex polytopes ⋮ A Jordan-Brouwer separation theorem for polyhedral pseudomanifolds ⋮ Polytopes, graphs, and complexes ⋮ Irreducible convex sets ⋮ Higher connectivity of tropicalizations ⋮ Catalan triangulations of the Möbius band ⋮ Drawing polytopal graphs with {\texttt{polymake}} ⋮ Self-dual binary codes from small covers and simple polytopes ⋮ Minimal and reduced pairs of convex bodies ⋮ Paths in the one‐skeleton of a convex body ⋮ On the connectivity of manifold graphs ⋮ Polytopality and Cartesian products of graphs ⋮ Polytopes close to being simple ⋮ On 3‐polytopes with non‐Hamiltonian prisms ⋮ Uniformly connected graphs ⋮ A theory of polytopes ⋮ Structural Conditions for Saddle-Node Bifurcations in Chemical Reaction Networks ⋮ Edge connectivity of simplicial polytopes ⋮ Reconstructing simplicial polytopes from their graphs and affine 2-stresses ⋮ Treetopes and their graphs ⋮ On the hypergraph connectivity of skeleta of polytopes ⋮ Polyhedral graph abstractions and an approach to the linear Hirsch conjecture ⋮ Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling ⋮ The higher Stasheff‐Tamari posets ⋮ Connectivity through bounds for the Castelnuovo-Mumford regularity ⋮ A property of graphs of convex polytopes ⋮ Absolute irreducibility of polynomials via Newton polytopes ⋮ Connectivity of cubical polytopes ⋮ Notes on acyclic orientations and the shelling lemma ⋮ Connectivity of chamber graphs of buildings and related complexes ⋮ Rigidity and the lower bound theorem. I ⋮ Unnamed Item ⋮ On connectivity of the facet graphs of simplicial complexes ⋮ Random walks on the vertices of transportation polytopes with constant number of sources ⋮ A new proof of Balinski's theorem on the connectivity of polytopes ⋮ Multiparametric linear programming with applications to control ⋮ The linkedness of cubical polytopes: the cube ⋮ The \(d\)-step conjecture for polyhedra of dimension \(d<6\) ⋮ Enumeration of the facets of cut polytopes over some highly symmetric graphs ⋮ On cycles through prescribed vertices in weakly separable graphs ⋮ On the Holt-Klee property for oriented matroid programming ⋮ Generating planar 4-connected graphs ⋮ Circuits and paths through specified nodes ⋮ The Holt-Klee condition for oriented matroids ⋮ Skeleton matching polytope: realization and isomorphism ⋮ On the no-signaling approach to quantum nonlocality ⋮ The connectivity of acyclic orientation graphs ⋮ Hamiltonicity in (0-1)-polyhedra ⋮ Classification of eight-dimensional perfect forms ⋮ Connectivity of triangulation flip graphs in the plane ⋮ Finding all maximal efficient faces in multiobjective linear programming

This page was built for publication: On the graph structure of convex polyhedra in \(n\)-space