The Tutte polynomial modulo a prime

DOI10.1016/S0196-8858(03)00084-8MaRDI QIDQ1433006zbMATH OpenFDO

Authors Andrew Goodall

Publication date 15 June 2004

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0196-8858(03)00084-8

zbMATH Keywords

Tutte polynomial

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
• scientific article; zbMATH DE number 1369835
• Tutte polynomials computable in polynomial time
• On the evaluation at ( - , ) of the Tutte polynomial of a binary matroid
• The computational complexity of knot and matroid polynomials

Cites work

• A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs
• scientific article; zbMATH DE number 437298 (Why is no real title available?)
• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• NP is as easy as detecting unique solutions
• On the computational complexity of the Jones and Tutte polynomials
• The Computational Complexity of the Tutte Plane: the Bipartite Case
• The Computational Complexity of Tutte Invariants for Planar Graphs

Cited in

(1)

• The coefficients of the Tutte polynomial are not unimodal

This page was built for publication: The Tutte polynomial modulo a prime

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1433006)