On monochromatic component size for improper colourings (Q1775062): Difference between revisions

@@ Property / cites work @@
+Q4255999
@@ Property / cites work: Q4255999 / rank @@
+Normal rank
@@ Property / cites work @@
+Path chromatic numbers of graphs
@@ Property / cites work: Path chromatic numbers of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The strong chromatic number of a graph
@@ Property / cites work: The strong chromatic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning into graphs with only small components
+Normal rank
@@ Property / cites work @@
+Q3781121
@@ Property / cites work: Q3781121 / rank @@
+Normal rank
@@ Property / cites work @@
+On linear k-arboricity
@@ Property / cites work: On linear k-arboricity / rank @@
+Normal rank
@@ Property / cites work @@
+Q5560916
@@ Property / cites work: Q5560916 / rank @@
+Normal rank
@@ Property / cites work @@
+Relaxed coloring of a graph
@@ Property / cites work: Relaxed coloring of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Fragmentability of graphs
@@ Property / cites work: Fragmentability of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring
+Normal rank
@@ Property / cites work @@
+COVERING AND PACKING IN GRAPHS, I.
@@ Property / cites work: COVERING AND PACKING IN GRAPHS, I. / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded size components -- partitions and transversals.
+Normal rank
@@ Property / cites work @@
+Computational complexity of \((2,2)\) path chromatic number problem
+Normal rank
@@ Property / cites work @@
+Q4294602
@@ Property / cites work: Q4294602 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5530470
@@ Property / cites work: Q5530470 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3688407
@@ Property / cites work: Q3688407 / rank @@
+Normal rank
@@ Property / cites work @@
+Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
+Normal rank
@@ Property / cites work @@
+Relaxed chromatic numbers of graphs
@@ Property / cites work: Relaxed chromatic numbers of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3035307
@@ Property / cites work: Q3035307 / rank @@
+Normal rank