scientific article; zbMATH DE number 1953195

MaRDI QIDQ4414641zbMATH OpenFDO

Authors Volker Kaibel

Publication date 25 July 2003

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

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

Recommendations

• scientific article; zbMATH DE number 1538125
• 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)

• Graphs, skeleta and reconstruction of polytopes
• scientific article; zbMATH DE number 1538125 (Why is no real title available?)
• scientific article; zbMATH DE number 1538126 (Why is no real title available?)
• Finding a Polytope from Its Graph in Polynomial Time
• Finding a simple polytope from its graph in polynomial time
• Reconstruction of Weakly Simple Polygons from Their Edges
• A simple way to tell a simple polytope from its graph
• Computing the face lattice of a polytope from its vertex-facet incidences
• On the reconstruction of polytopes
• Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
• On the faces of simple polytopes
• Reconstructibility of matroid polytopes
• On the \(k\)-systems of a simple polytope

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