Computing Graph Polynomials on Graphs of Bounded Clique-Width

2006/01/01 by Johann A. Makowsky, J. A. Makowsky, Udi Rotics +2 · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Alternating polynomial #Bounded function #Chordal graph #Chromatic polynomial #Combinatorics #Discrete mathematics #Graph #Graph Labeling and Dimension Problems #Graph theory and applications #Mathematics #Matrix polynomial #Polynomial

paper · doi:10.1007/11917496_18

crossref issued 2006/01/01 · crossref published 2006/01/01 · crossref published-print 2006/01/01 · openalex publication_date 2006/01/01 · crossref created 2006/10/18 · crossref deposited 2020/11/17 · crossref indexed 2025/08/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Citations

• Computing the Tutte Polynomial on Graphs of Bounded Clique-Width
• Upper bounds to the clique width of graphs
• Modern Graph Theory
• On the computational complexity of the Jones and Tutte polynomials
• Complexity of Finding Embeddings in a k-Tree
• Acyclic orientations of graphs
• The Complexity of Enumeration and Reliability Problems
• Vertex-minors, monadic second-order logic, and a conjecture by Seese
• A Determinant Formula for the Number of Ways of Coloring a Map
• Graduate Texts in Mathematics

Cited by

• Graph Polynomials and Their Applications I: The Tutte Polynomial
• Chromatic polynomial [wikipedia]