Reconstructing a simple polytope from its graph

DOI10.1007/3-540-36478-1_11MaRDI QIDQ4414641zbMATH OpenFDO

Authors Volker Kaibel

Publication date 25 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0202103, http://link.springer.de/link/service/series/0558/bibs/2570/25700105.htm

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Reconstructing a simple polytope from its graph
• On the reconstruction of polytopes
• Finding a simple polytope from its graph in polynomial time
• Finding a Polytope from Its Graph in Polynomial Time
• A simple way to tell a simple polytope from its graph

Cited in

(13)

• Finding a simple polytope from its graph in polynomial time
• A simple way to tell a simple polytope from its graph
• On the \(k\)-systems of a simple polytope
• On the reconstruction of polytopes
• Computing the face lattice of a polytope from its vertex-facet incidences
• Reconstruction of Weakly Simple Polygons from Their Edges
• Reconstructing a simple polytope from its graph
• Reconstructing a non-simple polytope from its graph
• Reconstructibility of matroid polytopes
• On the faces of simple polytopes
• Finding a Polytope from Its Graph in Polynomial Time
• Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
• Graphs, skeleta and reconstruction of polytopes

This page was built for publication: Reconstructing a simple polytope from its graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414641)