The following pages link to Nowhere-zero flow polynomials (Q703684):
Displaying 6 items.
- Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits (Q898252) (← links)
- Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares (Q2029005) (← links)
- On the complexity of Hilbert refutations for partition (Q2252121) (← links)
- Parity, Eulerian subgraphs and the Tutte polynomial (Q2483482) (← links)
- Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz (Q3552513) (← links)
- Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases (Q6170824) (← links)
