On the distance and multidistance graph embeddability problem (Q334409): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / 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 @@
+On Sets of Distances of n Points
@@ Property / cites work: On Sets of Distances of n Points / 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 @@
+On the Computational Complexity of Degenerate Unit Distance Representations of Graphs
+Normal rank
@@ Property / cites work @@
+Realizability of Graphs and Linkages
@@ Property / cites work: Realizability of Graphs and Linkages / rank @@
+Normal rank
@@ Property / cites work @@
+Q3315532
@@ Property / cites work: Q3315532 / 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
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of H-coloring
@@ Property / cites work: On the complexity of H-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of infinite \(H\)-colouring
@@ Property / cites work: The complexity of infinite \(H\)-colouring / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of finding iso- and other morphisms for partial \(k\)- trees
+Normal rank