Pages that link to "Item:Q1015377"

The following pages link to From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377):

Displaying 22 items.

• Strongly polynomial sequences as interpretations (Q334158) (← links)
• A survey on recurrence relations for the independence polynomial of hypergraphs (Q343776) (← links)
• Complexity and approximability of the cover polynomial (Q445242) (← links)
• Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width (Q463068) (← links)
• Efficient computation of the characteristic polynomial of a tree and related tasks (Q528854) (← links)
• The enumeration of vertex induced subgraphs with respect to the number of components (Q648958) (← links)
• On the complexity of generalized chromatic polynomials (Q679542) (← links)
• In praise of homomorphisms (Q826325) (← links)
• Polynomial graph invariants from homomorphism numbers (Q906477) (← links)
• Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions (Q987376) (← links)
• An extension of the bivariate chromatic polynomial (Q1041177) (← links)
• Border correlations, lattices, and the subgraph component polynomial (Q1678101) (← links)
• Almost unimodal and real-rooted graph polynomials (Q2107505) (← links)
• A logician's view of graph polynomials (Q2273013) (← links)
• Squares and primitivity in partial words (Q2341712) (← links)
• Semantic Equivalence of Graph Polynomials Definable in Second Order Logic (Q2820700) (← links)
• A Graph Polynomial for Independent Sets of Bipartite Graphs (Q2911069) (← links)
• Border Correlations, Lattices, and the Subgraph Component Polynomial (Q2946042) (← links)
• Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width (Q3012830) (← links)
• Complexity of the Bollobás-Riordan Polynomial (Q3503627) (← links)
• Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants (Q3507454) (← links)
• The Equivalence of Two Graph Polynomials and a Symmetric Function (Q3552515) (← links)