The Tutte polynomial modulo a prime

DOI10.1016/S0196-8858(03)00084-8zbMath1041.05071MaRDI QIDQ1433006

Andrew J. Goodall

Publication date: 15 June 2004

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

zbMATH Keywords

Tutte polynomial

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• NP is as easy as detecting unique solutions
• The Computational Complexity of the Tutte Plane: the Bipartite Case
• A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs
• On the computational complexity of the Jones and Tutte polynomials
• The Computational Complexity of Tutte Invariants for Planar Graphs