On approximating the b-chromatic number (Q1765381): Difference between revisions

@@ Property / author @@
-Juan Carlos Vera
@@ Property / author: Juan Carlos Vera / rank @@
-Normal rank
@@ Property / author @@
+Juan Carlos Vera
@@ Property / author: Juan Carlos Vera / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q58051183
@@ Property / Wikidata QID: Q58051183 / 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.dam.2004.09.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2060043675
@@ Property / OpenAlex ID: W2060043675 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Some optimal inapproximability results
@@ Property / cites work: Some optimal inapproximability results / rank @@
+Normal rank
@@ Property / cites work @@
+The b-chromatic number of a graph
@@ Property / cites work: The b-chromatic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Some bounds for the \(b\)-chromatic number of a graph
+Normal rank
@@ Property / cites work @@
+Q4414507
@@ Property / cites work: Q4414507 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1765381