Pages that link to "Item:Q1569027"
From MaRDI portal
The following pages link to New results for the Martin polynomial (Q1569027):
Displaying 17 items.
- The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Fast evaluation of interlace polynomials on graphs of bounded treewidth (Q634679) (← links)
- The interlace polynomial of a graph (Q705880) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- Circle graphs and the cycle double cover conjecture (Q1025572) (← links)
- Homomorphisms and polynomial invariants of graphs (Q1039439) (← links)
- Farrell polynomials on graphs of bounded tree width (Q1398293) (← links)
- Identities for circuit partition polynomials, with applications to the Tutte polynomial (Q1433000) (← links)
- Hopf algebras and Tutte polynomials (Q1693353) (← links)
- Exploring the Tutte-Martin connection (Q1827709) (← links)
- Evaluations of the circuit partition polynomial (Q1850612) (← links)
- A free subalgebra of the algebra of matroids (Q2567282) (← links)
- Transition polynomials (Q2575798) (← links)
- A Graph Integral Formulation of the Circuit Partition Polynomial (Q3103635) (← links)
- The complexity of the fermionant, and immanants of constant width (Q3191574) (← links)
- Statistics of Feynman amplitudes in \(\phi^4\)-theory (Q6142751) (← links)
