Approximation results for the optimum cost chromatic partition problem (Q4572001): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-63165-8_226
+Normal rank
@@ Property / OpenAlex ID @@
+W2281633950
@@ Property / OpenAlex ID: W2281633950 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4281629
@@ Property / cites work: Q4281629 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
+Normal rank
@@ Property / cites work @@
+On chain and antichain families of a partially ordered set
+Normal rank
@@ Property / cites work @@
+Algorithms for maximumk-colorings andk-coverings of transitive graphs
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4284253
@@ Property / cites work: Q4284253 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation results for the optimum cost chromatic partition problem
+Normal rank
@@ Property / cites work @@
+Q4395326
@@ Property / cites work: Q4395326 / rank @@
+Normal rank
@@ Property / cites work @@
+On a graph partition problem with application to VLSI layout
+Normal rank
@@ Property / cites work @@
+The maximum k-colorable subgraph problem for chordal graphs
+Normal rank