Finding a simple polytope from its graph in polynomial time (Q1017924): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4368722 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Puzzles and polytope isomorphisms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the \(k\)-systems of a simple polytope / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4414641 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing the face lattice of a polytope from its vertex-facet incidences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A simple way to tell a simple polytope from its graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3819622 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Realization spaces of 4-polytopes are universal / rank | |||
Normal rank |
Latest revision as of 13:23, 1 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Finding a simple polytope from its graph in polynomial time |
scientific article |
Statements
Finding a simple polytope from its graph in polynomial time (English)
0 references
13 May 2009
0 references
polytope
0 references
graph
0 references
polynomial time
0 references