Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166): Difference between revisions

@@ Property / cites work @@
+The complexity of \(G\)-free colourability
@@ Property / cites work: The complexity of \(G\)-free colourability / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of some problems related to GRAPH 3-COLORABILITY
+Normal rank
@@ Property / cites work @@
+More about subcolorings
@@ Property / cites work: More about subcolorings / rank @@
+Normal rank
@@ Property / cites work @@
+List monopolar partitions of claw-free graphs
@@ Property / cites work: List monopolar partitions of claw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Polarity and Monopolarity of Graphs
@@ Property / cites work: On the Polarity and Monopolarity of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Solving partition problems with colour-bipartitions
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Polarity of chordal graphs
@@ Property / cites work: Polarity of chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for unipolar and generalized split graphs
+Normal rank
@@ Property / cites work @@
+Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard
+Normal rank
@@ Property / cites work @@
+Graph Subcolorings: Complexity and Algorithms
@@ Property / cites work: Graph Subcolorings: Complexity and Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Subcolorings and the subchromatic number of a graph
+Normal rank
@@ Property / cites work @@
+The splittance of a graph
@@ Property / cites work: The splittance of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis
+Normal rank
@@ Property / cites work @@
+Q5275384
@@ Property / cites work: Q5275384 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of (O,P)-partition problems
+Normal rank
@@ Property / cites work @@
+Complexity and algorithms for recognizing polar and monopolar graphs
+Normal rank
@@ Property / cites work @@
+Wheel-Free Deletion Is W[2]-Hard
@@ Property / cites work: Wheel-Free Deletion Is W[2]-Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Recognition of unipolar and generalised split graphs
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding odd cycle transversals.
@@ Property / cites work: Finding odd cycle transversals. / rank @@
+Normal rank
@@ Property / cites work @@
+On 2-Subcolourings of Chordal Graphs
@@ Property / cites work: On 2-Subcolourings of Chordal Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3743346
@@ Property / cites work: Q3743346 / rank @@
+Normal rank