Finding a simple polytope from its graph in polynomial time (Q1017924): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00454-008-9121-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2051898557
@@ Property / OpenAlex ID: W2051898557 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368722
@@ Property / cites work: Q4368722 / rank @@
+Normal rank
@@ Property / cites work @@
+Puzzles and polytope isomorphisms
@@ Property / cites work: Puzzles and polytope isomorphisms / rank @@
+Normal rank
@@ Property / cites work @@
+On the \(k\)-systems of a simple polytope
@@ Property / cites work: On the \(k\)-systems of a simple polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Q4414641
@@ Property / cites work: Q4414641 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the face lattice of a polytope from its vertex-facet incidences
+Normal rank
@@ Property / cites work @@
+A simple way to tell a simple polytope from its graph
+Normal rank
@@ Property / cites work @@
+Q3819622
@@ Property / cites work: Q3819622 / rank @@
+Normal rank
@@ Property / cites work @@
+Realization spaces of 4-polytopes are universal
@@ Property / cites work: Realization spaces of 4-polytopes are universal / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1017924