On a bound of Graham and Spencer for a graph-colouring constant (Q2555862): Difference between revisions

@@ Property / cites work @@
+Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
+Normal rank
@@ Property / cites work @@
+On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon
+Normal rank
@@ Property / cites work @@
+Q5616720
@@ Property / cites work: Q5616720 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Relations and Chromatic Graphs
@@ Property / cites work: Combinatorial Relations and Chromatic Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+On Ramsey numbers and \(K_ r\)-coloring of graphs
@@ Property / cites work: On Ramsey numbers and \(K_ r\)-coloring of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Construction of Certain Graphs
@@ Property / cites work: The Construction of Certain Graphs / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0095-8956(73)90021-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2000639038
@@ Property / OpenAlex ID: W2000639038 / rank @@
+Normal rank