Pages that link to "Item:Q1433009"
From MaRDI portal
The following pages link to On the algebraic complexity of some families of coloured Tutte polynomials (Q1433009):
Displaying 10 items.
- Complexity and approximability of the cover polynomial (Q445242) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions (Q987376) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width (Q1764811) (← links)
- A Dichotomy Theorem for Polynomial Evaluation (Q3182924) (← links)
- Complexity of the Bollobás-Riordan Polynomial (Q3503627) (← links)
- Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants (Q3507454) (← links)
- A Subset Expansion of the Coloured Tutte Polynomial (Q4819239) (← links)
- How I got to like graph polynomials (Q6593617) (← links)