On the complexity of rainbow coloring problems (Q1647834): Difference between revisions

@@ Property / cites work @@
+New Hardness Results in Rainbow Connectivity
@@ Property / cites work: New Hardness Results in Rainbow Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+On Linear Time Minor Tests with Depth-First Search
+Normal rank
@@ Property / cites work @@
+Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
+Normal rank
@@ Property / cites work @@
+Hardness and algorithms for rainbow connection
@@ Property / cites work: Hardness and algorithms for rainbow connection / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow Colouring of Split and Threshold Graphs
@@ Property / cites work: Rainbow Colouring of Split and Threshold Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability of Rainbow Colouring
@@ Property / cites work: Inapproximability of Rainbow Colouring / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow connection in graphs
@@ Property / cites work: Rainbow connection in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow trees in graphs and generalized connectivity
+Normal rank
@@ Property / cites work @@
+Further hardness results on the rainbow vertex-connection number of graphs
+Normal rank
@@ Property / cites work @@
+The complexity of determining the rainbow vertex-connection of a graph
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of rainbow coloring problems
@@ Property / cites work: On the complexity of rainbow coloring problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the corona of two graphs
@@ Property / cites work: On the corona of two graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
+Normal rank
@@ Property / cites work @@
+A logical approach to multicut problems
@@ Property / cites work: A logical approach to multicut problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4560246
@@ Property / cites work: Q4560246 / rank @@
+Normal rank
@@ Property / cites work @@
+The rainbow connection of a graph is (at most) reciprocal to its minimum degree
+Normal rank
@@ Property / cites work @@
+Further hardness results on rainbow and strong rainbow connectivity
+Normal rank
@@ Property / cites work @@
+The strong rainbow vertex-connection of graphs
@@ Property / cites work: The strong rainbow vertex-connection of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow connections of graphs: a survey
@@ Property / cites work: Rainbow connections of graphs: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Rainbow connection number and connected dominating sets
+Normal rank
@@ Property / cites work @@
+On the rainbow connectivity of graphs: complexity and FPT algorithms
+Normal rank
@@ Property / cites work @@
+Q3002782
@@ Property / cites work: Q3002782 / rank @@
+Normal rank