Computing the Tutte Polynomial on Graphs of Bounded Clique-Width

2005/01/01 by Omer Giménez, Petr Hliněný, Marc Noy · 3 citations
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Bounded function #Chordal graph #Chromatic polynomial #Combinatorics #Discrete mathematics #Graph #Graph theory and applications #Line graph #Mathematics #Pathwidth #Time complexity #Treewidth #Tutte polynomial #Voltage graph

paper · doi:10.1007/11604686_6

crossref issued 2005/01/01 · crossref published 2005/01/01 · crossref published-print 2005/01/01 · openalex publication_date 2005/01/01 · crossref created 2005/12/05 · crossref deposited 2021/04/27 · crossref indexed 2024/09/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Citations

• Upper bounds to the clique width of graphs
• A Linear Recognition Algorithm for Cographs
• On the computational complexity of the Jones and Tutte polynomials
• Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width

Cited by

• Computing Graph Polynomials on Graphs of Bounded Clique-Width
• Exponential Time Complexity of the Permanent and the Tutte Polynomial
• Chromatic polynomial [wikipedia]