Computing the Tutte polynomial of a graph of moderate size

1995/01/01 by Kyoko Sekine, Hiroshi Imai, Seiichiro Tani · 7 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Butterfly graph #Combinatorics #Computer science #Discrete mathematics #Graph #Graph theory and applications #Interconnection Networks and Systems #Line graph #Mathematics #Planar graph #Time complexity #Tutte polynomial #Voltage graph

paper · doi:10.1007/bfb0015427

crossref issued 1995/01/01 · crossref published 1995/01/01 · crossref published-print 1995/01/01 · openalex publication_date 1995/01/01 · crossref published-online 2005/06/09 · crossref created 2005/11/13 · crossref deposited 2019/02/04 · openalex created_date 2025/10/10 · crossref indexed 2026/06/10 · openalex updated_date 2026/07/29

Citations

• Binary Decision Diagrams
• Graph-Based Algorithms for Boolean Function Manipulation
• A Contribution to the Theory of Chromatic Polynomials

Cited by

• Computing the Tutte Polynomial in Vertex-Exponential Time
• Computing Tutte Polynomials
• Graph Polynomials and Their Applications I: The Tutte Polynomial
• Exponential Time Complexity of the Permanent and the Tutte Polynomial
• Chromatic polynomial [wikipedia]
• Graph coloring [wikipedia]
• Tutte polynomial [wikipedia]