On the parameterized complexity of b-\textsc{chromatic number} (Q340565): Difference between revisions

@@ Property / cites work @@
+B-chromatic number: Beyond NP-hardness
@@ Property / cites work: B-chromatic number: Beyond NP-hardness / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the complexity of the chromatic number problem
+Normal rank
@@ Property / cites work @@
+Set Partitioning via Inclusion-Exclusion
@@ Property / cites work: Set Partitioning via Inclusion-Exclusion / 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 @@
+Q4414507
@@ Property / cites work: Q4414507 / rank @@
+Normal rank
@@ Property / cites work @@
+\(b\)-coloring of tight graphs
@@ Property / cites work: \(b\)-coloring of tight graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A note on approximating the \(b\)-chromatic number
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On the Grundy and \(b\)-chromatic numbers of a graph
+Normal rank
@@ Property / cites work @@
+A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs
+Normal rank
@@ Property / cites work @@
+Fast multiplication of large numbers
@@ Property / cites work: Fast multiplication of large numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Exact and approximate bandwidth
@@ Property / cites work: Exact and approximate bandwidth / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of vertex cover and edge cover with connectivity constraints
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank