Complete graphs without polychromatic circuits (Q1050348): Difference between revisions

@@ Property / cites work @@
+Complete graphs without polychromatic circuits
@@ Property / cites work: Complete graphs without polychromatic circuits / rank @@
+Normal rank
@@ Property / cites work @@
+On a problem of C. C. Chen and D. E. Daykin
@@ Property / cites work: On a problem of C. C. Chen and D. E. Daykin / rank @@
+Normal rank
@@ Property / cites work @@
+-colored triangles in edge-colored complete graphs. II
+Normal rank
@@ Property / cites work @@
+On the structure of complete graphs without alternating cycles
+Normal rank
@@ Property / cites work @@
+Q4075490
@@ Property / cites work: Q4075490 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3853641
@@ Property / cites work: Q3853641 / rank @@
+Normal rank
@@ Property / cites work @@
+More star sub-Ramsey numbers
@@ Property / cites work: More star sub-Ramsey numbers / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0012-365x(83)90263-7
+Normal rank
@@ Property / OpenAlex ID @@
+W1984387652
@@ Property / OpenAlex ID: W1984387652 / rank @@
+Normal rank