publication . Preprint . 2017

Reconstructing Nearly Simple Polytopes from their Graph

Doolittle, Joseph;
Open Access English
  • Published: 28 Jan 2017
Abstract
Comment: 13 pages
Subjects
arXiv: Mathematics::Metric GeometryMathematics::Combinatorics
free text keywords: Mathematics - Combinatorics, 52Bxx
Download from

[1] Roswitha Blind and Peter Mani-Levitska. Puzzles and polytope isomorphisms. In Computer aided geometric reasoning, Vol. I, II (Sophia-Antipolis, 1987), pages 255-274. INRIA, Rocquencourt, 1987.

[2] Eric J. Friedman. Finding a simple polytope from its graph in polynomial time. Discrete & Computational Geometry, 41(2):249-256, 2009.

[3] Haase and Ziegler. Examples and counterexamples for the perles conjecture. Discrete Comput. Geom., 28(1):29-44, July 2002.

[4] Michael Joswig, Volker Kaibel, and Friederike K¨orner. On thek-systems of a simple polytope. Israel Journal of Mathematics, 129(1):109-117, 2002.

[5] Gil Kalai. A simple way to tell a simple polytope from its graph. J. Combin. Theory Ser. A, 49(2):381-383, 1988. [OpenAIRE]

[6] Hiroyuki Miyata, Sonoko Moriyama, and Komei Fukuda. Classification of Oriented Matroids, 2016 (accessed December 21, 2016). http://www-imai.is.s.u-tokyo.ac.jp/~hmiyata/oriented_matroids/.

Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue