Turán type results for distance graphs (Q331389): Difference between revisions

@@ Property / DOI @@
-.1007/s00454-016-9817-z
@@ Property / DOI: 10.1007/s00454-016-9817-z / 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 @@
+Independence, clique size and maximum degree
@@ Property / cites work: Independence, clique size and maximum degree / rank @@
+Normal rank
@@ Property / cites work @@
+/30 (Finding large independent sets in connected triangle-free 3- regular graphs)
+Normal rank
@@ Property / cites work @@
+Finding Independent Sets in Triangle-Free Graphs
@@ Property / cites work: Finding Independent Sets in Triangle-Free Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on size and independence inK4-free graphs
+Normal rank
@@ Property / cites work @@
+On large subgraphs of a distance graph which have small chromatic number
+Normal rank
@@ Property / cites work @@
+The realization of distances within sets in Euclidean space
+Normal rank
@@ Property / cites work @@
+Finding independent sets in \(K_4\)-free 4-regular connected graphs
+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 / DOI @@
+.1007/S00454-016-9817-Z
@@ Property / DOI: 10.1007/S00454-016-9817-Z / rank @@
+Normal rank