scientific article; zbMATH DE number 1182910

MaRDI QIDQ4401007zbMATH OpenFDO

Authors Gil Kalai

Publication date 12 April 1999

zbMATH Keywords

reconstructionconnectivityskeletonSteinitz theoremHirsch conjectureshellabilityKlee-Minty cubepolytopal graphsdiameters of polytope graphsfacet-forming polytopes

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Recommendations

• Diameter of polyhedra: limits of abstraction
• On the graph connectivity of skeleta of convex polytopes
• Recent results around the diameter of polyhedra
• scientific article; zbMATH DE number 863487
• Upper bounds for the diameter and height of graphs of convex polyhedra

Cited in

(14)

• Monotone diameter of bisubmodular polyhedra
• On the graph connectivity of skeleta of convex polytopes
• Skeleton matching polytope: realization and isomorphism
• Morse matchings on polytopes
• Some properties of the skeleton of the pyramidal tours polytope
• Simple polytopes without small separators. II: Thurston's bound
• Empty simplices of polytopes and graded Betti numbers
• The duality between color and kinematics and its applications
• On potential theoretic skeletons of polyhedra
• scientific article; zbMATH DE number 764406 (Why is no real title available?)
• Linkages in Polytope Graphs
• On connectivity of the facet graphs of simplicial complexes
• Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
• Subdivisions of shellable complexes

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 Q4401007)