On the complexity of generalized chromatic polynomials (Q679542): Difference between revisions

@@ Property / OpenAlex ID @@
+W2580993430
@@ Property / OpenAlex ID: W2580993430 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.06639
@@ Property / arXiv ID: 1701.06639 / rank @@
+Normal rank
@@ 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 existence of uniquely \(-G\) colourable graphs
+Normal rank
@@ Property / cites work @@
+Partitioning into graphs with only small components
+Normal rank
@@ Property / cites work @@
+Acyclic coloring of graphs
@@ Property / cites work: Acyclic coloring of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of derived graphs
@@ Property / cites work: Characterizations of derived graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of generalized graph colorings
@@ Property / cites work: The complexity of generalized graph colorings / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of partition functions
@@ Property / cites work: The complexity of partition functions / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Homomorphisms with Complex Values: A Dichotomy Theorem
+Normal rank
@@ Property / cites work @@
+The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Holant Problems
@@ Property / cites work: Computational Complexity of Holant Problems / rank @@
+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 connection in graphs
@@ Property / cites work: Rainbow connection in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Defective coloring revisited
@@ Property / cites work: Defective coloring revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of generalized satisfiability counting problems
+Normal rank
@@ Property / cites work @@
+Harmonious colourings of graphs
@@ Property / cites work: Harmonious colourings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4521549
@@ Property / cites work: Q4521549 / rank @@
+Normal rank
@@ Property / cites work @@
+Systems of distinct representatives and linear algebra
+Normal rank
@@ Property / cites work @@
+Q4352945
@@ Property / cites work: Q4352945 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of harmonious colouring for trees
@@ Property / cites work: The complexity of harmonious colouring for trees / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On cocolourings and cochromatic numbers of graphs
@@ Property / cites work: On cocolourings and cochromatic numbers of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic colorings of planar graphs
@@ Property / cites work: Acyclic colorings of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the injective chromatic number of graphs
@@ Property / cites work: On the injective chromatic number of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Harmonious Coloring of Graphs
@@ Property / cites work: On the Harmonious Coloring of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Planar Counting Problems
@@ Property / cites work: The Complexity of Planar Counting Problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of General Graph Factor Problems
+Normal rank
@@ Property / cites work @@
+Connection Matrices and the Definability of Graph Parameters
+Normal rank
@@ Property / cites work @@
+On sequences of polynomials arising from graph invariants
+Normal rank
@@ Property / cites work @@
+On Counting Generalized Colorings
@@ Property / cites work: On Counting Generalized Colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Q3118385
@@ Property / cites work: Q3118385 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Structure of Polynomial Time Reducibility
@@ Property / cites work: On the Structure of Polynomial Time Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+Hard Enumeration Problems in Geometry and Combinatorics
+Normal rank
@@ Property / cites work @@
+Graph coloring with no large monochromatic components
+Normal rank
@@ Property / cites work @@
+From a zoo to a zoology: Towards a general theory of graph polynomials
+Normal rank
@@ Property / cites work @@
+A Computational Framework for the Study of Partition Functions and Graph Polynomials
+Normal rank
@@ Property / cites work @@
+On the location of roots of graph polynomials
@@ Property / cites work: On the location of roots of graph polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient approximation of convex recolorings
@@ Property / cites work: Efficient approximation of convex recolorings / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
+Normal rank
@@ Property / cites work @@
+Q4175304
@@ Property / cites work: Q4175304 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / cites work @@
+Holographic Algorithms
@@ Property / cites work: Holographic Algorithms / rank @@
+Normal rank