Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs (Q641170): Difference between revisions

@@ Property / cites work @@
+Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
+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 @@
+Vertex coverings by monochromatic cycles and trees
+Normal rank
@@ Property / cites work @@
+An improved bound for the monochromatic cycle partition number
+Normal rank
@@ Property / cites work @@
+Partitioning complete bipartite graphs by monochromatic cycles
+Normal rank
@@ Property / cites work @@
+Blow-up lemma
@@ Property / cites work: Blow-up lemma / rank @@
+Normal rank
@@ Property / cites work @@
+Q4878666
@@ Property / cites work: Q4878666 / rank @@
+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 @@
+Q4339095
@@ Property / cites work: Q4339095 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5342985
@@ Property / cites work: Q5342985 / rank @@
+Normal rank
@@ Property / cites work @@
+Monochromatic cycle partitions of edge-colored graphs
+Normal rank
@@ Property / cites work @@
+Vertex partitions by connected monochromatic \(k\)-regular graphs
+Normal rank