On computational complexity of length embeddability of graphs (Q2629266): Difference between revisions

@@ Property / arXiv ID @@
+.5555
@@ Property / arXiv ID: 1410.5555 / rank @@
+Normal rank
@@ Property / cites work @@
+Research Problems in Discrete Geometry
@@ Property / cites work: Research Problems in Discrete Geometry / rank @@
+Normal rank
@@ Property / cites work @@
+Q4309118
@@ Property / cites work: Q4309118 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5808059
@@ Property / cites work: Q5808059 / rank @@
+Normal rank
@@ Property / cites work @@
+On Sets of Distances of n Points
@@ Property / cites work: On Sets of Distances of n Points / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3315532
@@ Property / cites work: Q3315532 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Degenerate Unit Distance Representations of Graphs
+Normal rank
@@ Property / cites work @@
+Q3232347
@@ Property / cites work: Q3232347 / rank @@
+Normal rank
@@ Property / cites work @@
+Borsuk's problem and the chromatic numbers of some metric spaces
+Normal rank
@@ Property / cites work @@
+Coloring Distance Graphs and Graphs of Diameters
@@ Property / cites work: Coloring Distance Graphs and Graphs of Diameters / rank @@
+Normal rank
@@ Property / cites work @@
+Q3464534
@@ Property / cites work: Q3464534 / rank @@
+Normal rank
@@ Property / cites work @@
+On the chromatic numbers of spheres in Euclidean spaces
+Normal rank
@@ Property / cites work @@
+On the chromatic numbers of spheres in \(\mathbb R^n\)
+Normal rank