Two notions of unit distance graphs (Q2451892): Difference between revisions

@@ Property / DOI @@
-.1016/j.jcta.2014.02.006
@@ Property / DOI: 10.1016/j.jcta.2014.02.006 / rank @@
-Normal rank
@@ Property / cites work @@
+Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+The chromatic number of random graphs
@@ Property / cites work: The chromatic number of random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
+Normal rank
@@ Property / cites work @@
+Q3918134
@@ Property / cites work: Q3918134 / rank @@
+Normal rank
@@ Property / cites work @@
+Distance graphs with large chromatic number and arbitrary girth
+Normal rank
@@ Property / cites work @@
+New bounds for the distance Ramsey number
@@ Property / cites work: New bounds for the distance Ramsey number / rank @@
+Normal rank
@@ Property / cites work @@
+Note on induced subgraphs of the unit distance graph \(E^ n\)
+Normal rank
@@ Property / cites work @@
+On the dimension to represent a graph by a unit distance graph
+Normal rank
@@ Property / cites work @@
+Short cycles in random regular graphs
@@ Property / cites work: Short cycles in random regular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of zero-patterns of a sequence of polynomials
+Normal rank
@@ Property / DOI @@
+.1016/J.JCTA.2014.02.006
@@ Property / DOI: 10.1016/J.JCTA.2014.02.006 / rank @@
+Normal rank