On the minimum monochromatic or multicolored subgraph partition problems (Q2456352): Difference between revisions

@@ Property / author @@
+Xue Liang Li
@@ Property / author: Xue Liang Li / rank @@
+Normal rank
@@ 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.1016/j.tcs.2007.04.033
+Normal rank
@@ Property / OpenAlex ID @@
+W2026904819
@@ Property / OpenAlex ID: W2026904819 / rank @@
+Normal rank
@@ Property / cites work @@
+Multicoloured Hamilton cycles
@@ Property / cites work: Multicoloured Hamilton cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Multicolored forests in bipartite decompositions of graphs
+Normal rank
@@ Property / cites work @@
+Partitioning into graphs with only small components
+Normal rank
@@ Property / cites work @@
+Partitions of graphs into one or two independent sets and cliques
+Normal rank
@@ Property / cites work @@
+Q4659605
@@ Property / cites work: Q4659605 / rank @@
+Normal rank
@@ Property / cites work @@
+Multicolored trees in complete graphs
@@ Property / cites work: Multicolored trees in complete graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph partition problems into cycles and paths
@@ Property / cites work: Graph partition problems into cycles and paths / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex coverings by monochromatic cycles and trees
+Normal rank
@@ Property / cites work @@
+Q3139750
@@ Property / cites work: Q3139750 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of graph partition problems
@@ Property / cites work: Complexity of graph partition problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228484
@@ Property / cites work: Q4228484 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Some Edge-Partition Problems
+Normal rank
@@ Property / cites work @@
+Partitioning by monochromatic trees
@@ Property / cites work: Partitioning by monochromatic trees / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning complete bipartite graphs by monochromatic cycles
+Normal rank
@@ Property / cites work @@
+Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees
+Normal rank
@@ Property / cites work @@
+The complexity for partitioning graphs by monochromatic trees, cycles and paths
+Normal rank
@@ Property / cites work @@
+Partitioning complete multipartite graphs by monochromatic trees
+Normal rank
@@ Property / cites work @@
+Q4130999
@@ Property / cites work: Q4130999 / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized partitions of graphs
@@ Property / cites work: Generalized partitions of graphs / 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 @@
+Graph colourings and partitions
@@ Property / cites work: Graph colourings and partitions / rank @@
+Normal rank