The graph of an abstract polytope
From MaRDI portal
Publication:3215919
DOI10.1007/BF01584675zbMATH Open0271.52007MaRDI QIDQ3215919FDOQ3215919
Authors: Katta G. Murty
Publication date: 1973
Published in: Mathematical Programming (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Polytopes and polyhedra (52Bxx)
Cites Work
Cited In (8)
- Graphs, skeleta and reconstruction of polytopes
- Necessary and sufficient conditions for the geometric realizability of a simple incidence graph
- Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count
- Extending shelling orders and a hierarchy of functions of unimodal simple polytopes
- Completely unimodal numberings of a simple polytope
- Polyhedral graph abstractions and an approach to the linear Hirsch conjecture
- Segments in enumerating faces
- Gewisse einfache Polytope sind durch ihren Graph eindeutig bestimmt. (Certain simple polytopes are uniquely determined by their graphs)
This page was built for publication: The graph of an abstract polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3215919)