Pages that link to "Item:Q1015377"
From MaRDI portal
The following pages link to From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377):
Displayed 9 items.
- Complexity and approximability of the cover polynomial (Q445242) (← links)
- The enumeration of vertex induced subgraphs with respect to the number of components (Q648958) (← links)
- Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions (Q987376) (← links)
- An extension of the bivariate chromatic polynomial (Q1041177) (← links)
- A Graph Polynomial for Independent Sets of Bipartite Graphs (Q2911069) (← 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)