Monochromatic cycle partitions of edge-colored graphs (Q3067062): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/jgt.20492
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.20492 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2063700183
@@ Property / OpenAlex ID: W2063700183 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
+Normal rank
@@ Property / cites work @@
+Sharp bounds for some multicolour Ramsey numbers
@@ Property / cites work: Sharp bounds for some multicolour Ramsey numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
+Normal rank
@@ Property / cites work @@
+Partitioning complete bipartite graphs by monochromatic cycles
+Normal rank
@@ Property / cites work @@
+Q3880849
@@ Property / cites work: Q3880849 / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning Two-Coloured Complete Graphs into  Two Monochromatic Cycles
+Normal rank
@@ Property / cites work @@
+Vertex partitions by connected monochromatic \(k\)-regular graphs
+Normal rank