A multivariate interlace polynomial and its computation for graphs of bounded clique-width

zbMath1181.05010MaRDI QIDQ1010789

Bruno Courcelle

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/117249

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Model theory of finite structures (03C13)

Related Items (13)

On the Tutte and Matching Polynomials for Complete Graphs ⋮ Evaluations of Graph Polynomials ⋮ Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs ⋮ The adjacency matroid of a graph ⋮ Interlace polynomials for multimatroids and delta-matroids ⋮ Fast evaluation of interlace polynomials on graphs of bounded treewidth ⋮ Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width ⋮ Binary matroids and local complementation ⋮ The transition matroid of a 4-regular graph: an introduction ⋮ Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width ⋮ Binary nullity, Euler circuits and interlace polynomials ⋮ Exponential Time Complexity of Weighted Counting of Independent Sets ⋮ Recurrence relations for graph polynomials on bi-iterative families of graphs

This page was built for publication: A multivariate interlace polynomial and its computation for graphs of bounded clique-width