Q5089217 (Q5089217): Difference between revisions

@@ Property / cites work @@
+Clique-transversal sets of line graphs and complements of line graphs
+Normal rank
@@ Property / cites work @@
+Coloring the Maximal Cliques of Graphs
@@ Property / cites work: Coloring the Maximal Cliques of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3575455
@@ Property / cites work: Q3575455 / rank @@
+Normal rank
@@ Property / cites work @@
+Fourier meets M\"{o}bius: fast subset convolution
@@ Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Colouring clique-hypergraphs of circulant graphs
@@ Property / cites work: Colouring clique-hypergraphs of circulant graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-Coloring Circular-Arc Graphs
@@ Property / cites work: Clique-Coloring Circular-Arc Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect graphs of arbitrarily large clique-chromatic number
+Normal rank
@@ Property / cites work @@
+Decomposing and Clique‐Coloring (Diamond, Odd‐Hole)‐Free Graphs
+Normal rank
@@ Property / cites work @@
+Exact Algorithms to Clique-Colour Graphs
@@ Property / cites work: Exact Algorithms to Clique-Colour Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Problems as Hard as CNF-SAT
@@ Property / cites work: On Problems as Hard as CNF-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-coloring some classes of odd-hole-free graphs
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Two-colouring all two-element maximal antichains
@@ Property / cites work: Two-colouring all two-element maximal antichains / rank @@
+Normal rank
@@ Property / cites work @@
+Intractability of Clique-Width Parameterizations
@@ Property / cites work: Intractability of Clique-Width Parameterizations / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-width III
@@ Property / cites work: Clique-width III / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems
+Normal rank
@@ Property / cites work @@
+On the complexity of bicoloring clique hypergraphs of graphs
+Normal rank
@@ Property / cites work @@
+Q4276003
@@ Property / cites work: Q4276003 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of clique coloring and related problems
+Normal rank
@@ Property / cites work @@
+The Grötzsch theorem for the hypergraph of maximal cliques
+Normal rank
@@ Property / cites work @@
+Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable
+Normal rank
@@ Property / cites work @@
+Clique-width of graphs defined by one-vertex extensions
+Normal rank
@@ Property / cites work @@
+Clique-transversal sets and clique-coloring in planar graphs
+Normal rank
@@ Property / cites work @@
+Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
+Normal rank