A complexity dichotomy for critical values of the \(b\)-chromatic number of graphs (Q2310757): Difference between revisions

@@ Property / cites work @@
+Coloring Graphs with Constraints on Connectivity
@@ Property / cites work: Coloring Graphs with Constraints on Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+On the \(b\)-continuity property of graphs
@@ Property / cites work: On the \(b\)-continuity property of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Set Partitioning via Inclusion-Exclusion
@@ Property / cites work: Set Partitioning via Inclusion-Exclusion / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs of girth at least 7 have high \(b\)-chromatic number
+Normal rank
@@ Property / cites work @@
+Hard coloring problems in low degree planar bipartite graphs
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of \(b\)-chromatic and partial Grundy numbers by induced subgraphs
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / 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 @@
+On the Grundy and \(b\)-chromatic numbers of a graph
+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 @@
+A complexity dichotomy for critical values of the b-chromatic number of graphs
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4414507
@@ Property / cites work: Q4414507 / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of b-\textsc{chromatic number}
+Normal rank