On the evaluation at (3,3) of the Tutte polynomial of a graph
From MaRDI portal
Publication:1121273
DOI10.1016/0095-8956(88)90079-2zbMath0674.05024OpenAlexW2015927509WikidataQ29544772 ScholiaQ29544772MaRDI QIDQ1121273
Publication date: 1988
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(88)90079-2
Related Items (24)
A parity result of Fraysseix, computational complexity of Tutte polynomials, and a conjecture on planar graphs ⋮ Isotropic systems ⋮ Graphic presentations of isotropic systems ⋮ On Tutte polynomials of matroids representable over \(GF(q)\) ⋮ Planarity, symmetry and counting tilings ⋮ Complexity classification of the eight-vertex model ⋮ Counterexamples to a conjecture of Las Vergnas ⋮ Beyond windability: approximability of the four-vertex model ⋮ Fast evaluation of interlace polynomials on graphs of bounded treewidth ⋮ Complexity classification of the six-vertex model ⋮ Interlace polynomials ⋮ Beyond \#CSP: a dichotomy for counting weighted Eulerian orientations with ARS ⋮ Identities for circuit partition polynomials, with applications to the Tutte polynomial ⋮ The Tutte polynomial of a morphism of matroids. III: Vectorial matroids ⋮ Tutte-Martin polynomials and orienting vectors of isotropic systems ⋮ Orienting transversals and transition polynomials of multimatroids ⋮ The complexity of planar Boolean \#CSP with complex weights ⋮ Distance Hereditary Graphs and the Interlace Polynomial ⋮ The interlace polynomial of a graph ⋮ A recipe theorem for the topological Tutte polynomial of Bollobás and Riordan ⋮ A Graph Integral Formulation of the Circuit Partition Polynomial ⋮ Exploring the Tutte-Martin connection ⋮ Evaluations of the circuit partition polynomial ⋮ A dichotomy for real weighted Holant problems
Cites Work
This page was built for publication: On the evaluation at (3,3) of the Tutte polynomial of a graph
