An anti-Ramsey theorem on cycles (Q2573806): Difference between revisions

@@ Property / cites work @@
+On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
+Normal rank
@@ Property / cites work @@
+On the minimum size of tight hypergraphs
@@ Property / cites work: On the minimum size of tight hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian path graphs
@@ Property / cites work: Hamiltonian path graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Path connected graphs
@@ Property / cites work: Path connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the hamiltonian path graph of a graph
@@ Property / cites work: On the hamiltonian path graph of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal colorings for properly colored subgraphs
@@ Property / cites work: Minimal colorings for properly colored subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+An anti-Ramsey theorem
@@ Property / cites work: An anti-Ramsey theorem / rank @@
+Normal rank
@@ Property / cites work @@
+A linear heterochromatic number of graphs
@@ Property / cites work: A linear heterochromatic number of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On restricted colourings of \(K_ n\)
@@ Property / cites work: On restricted colourings of \(K_ n\) / rank @@
+Normal rank
@@ Property / cites work @@
+Smallest 3-graphs having a 3-colored edge in every k-coloring
+Normal rank
@@ Property / cites work @@
+Panconnected graphs. II
@@ Property / cites work: Panconnected graphs. II / rank @@
+Normal rank
@@ Property / cites work @@
+Sufficient Conditions for Circuits in Graphs<sup>†</sup>
+Normal rank