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

MaRDI QIDQ1010789zbMATH OpenFDO

Authors 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, http://www.emis.de/journals/EJC/Volume_15/Abstracts/v15i1r69.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

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

Recommendations

• Fast evaluation of interlace polynomials on graphs of bounded treewidth
• Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
• Computing Graph Polynomials on Graphs of Bounded Clique-Width
• A two-variable interlace polynomial
• On the Complexity of the Interlace Polynomial

Cited in

(18)

• Recurrence relations for graph polynomials on bi-iterative families of graphs
• The adjacency matroid of a graph
• Interlace polynomials for multimatroids and delta-matroids
• Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
• Efficient computation of generalized Ising polynomials on graphs with fixed clique-width
• On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications
• Computing Graph Polynomials on Graphs of Bounded Clique-Width
• On the interlace polynomials
• Evaluations of Graph Polynomials
• Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width
• Fast evaluation of interlace polynomials on graphs of bounded treewidth
• Binary matroids and local complementation
• The transition matroid of a 4-regular graph: an introduction
• On the Tutte and Matching Polynomials for Complete Graphs
• Neighborhood covering and independence on P₄-tidy graphs and tree-cographs
• Exponential Time Complexity of Weighted Counting of Independent Sets
• Binary nullity, Euler circuits and interlace polynomials
• Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010789)