Finding a simple polytope from its graph in polynomial time
type: Item
instance of: scholarly article
title: Finding a simple polytope from its graph in polynomial time
zbMATH Open document ID: 1163.52004
author: Eric J. Friedman
published in: Discrete \& Computational Geometry
publication date: 2009-05-13T00:00:00Z
Mathematics Subject Classification ID: 52B05
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 5553477
zbMATH Keywords: polytope
zbMATH Keywords: graph
zbMATH Keywords: polynomial time
MaRDI profile type: Publication
full work available at URL: s00454-008-9121-7
OpenAlex ID: W2051898557
cites work: Q4368722
cites work: Puzzles and polytope isomorphisms
cites work: On the \(k\)-systems of a simple polytope
cites work: Q4414641
cites work: Computing the face lattice of a polytope from its vertex-facet incidences
cites work: A simple way to tell a simple polytope from its graph
cites work: Q3819622
cites work: Realization spaces of 4-polytopes are universal
DOI: 10.1007/S00454-008-9121-7
description: scientific article; zbMATH DE number 5553477