Pages that link to "Item:Q1121273"

The following pages link to On the evaluation at (3,3) of the Tutte polynomial of a graph (Q1121273):

Displaying 29 items.

• A dichotomy for real weighted Holant problems (Q260401) (← links)
• Fast evaluation of interlace polynomials on graphs of bounded treewidth (Q634679) (← links)
• Orienting transversals and transition polynomials of multimatroids (Q679544) (← links)
• The interlace polynomial of a graph (Q705880) (← links)
• On the evaluation at \((j,j^2)\) of the Tutte polynomial of a ternary matroid (Q857752) (← links)
• Isotropic systems (Q1101116) (← links)
• Graphic presentations of isotropic systems (Q1113912) (← links)
• On Tutte polynomials of matroids representable over \(GF(q)\) (Q1124595) (← links)
• Tutte-Martin polynomials and orienting vectors of isotropic systems (Q1180433) (← links)
• Interlace polynomials (Q1418963) (← links)
• Identities for circuit partition polynomials, with applications to the Tutte polynomial (Q1433000) (← links)
• The Tutte polynomial of a morphism of matroids. III: Vectorial matroids (Q1433001) (← links)
• New results for the Martin polynomial (Q1569027) (← links)
• Complexity classification of the six-vertex model (Q1706146) (← links)
• Exploring the Tutte-Martin connection (Q1827709) (← links)
• Evaluations of the circuit partition polynomial (Q1850612) (← links)
• Planarity, symmetry and counting tilings (Q1926029) (← links)
• Properties of the corolla polynomial of a 3-regular graph (Q1953427) (← links)
• The complexity of planar Boolean \#CSP with complex weights (Q2009629) (← links)
• Counterexamples to a conjecture of Las Vergnas (Q2198974) (← links)
• Beyond \#CSP: a dichotomy for counting weighted Eulerian orientations with ARS (Q2216112) (← links)
• A recipe theorem for the topological Tutte polynomial of Bollobás and Riordan (Q2275469) (← links)
• Some new evaluations of the Tutte polynomial (Q2490250) (← links)
• (Q2959973) (← links)
• A Graph Integral Formulation of the Circuit Partition Polynomial (Q3103635) (← links)
• A parity result of Fraysseix, computational complexity of Tutte polynomials, and a conjecture on planar graphs (Q5300994) (← links)
• Distance Hereditary Graphs and the Interlace Polynomial (Q5428369) (← links)
• Complexity classification of the eight-vertex model (Q6116195) (← links)
• Beyond windability: approximability of the four-vertex model (Q6204549) (← links)