A multivariate interlace polynomial and its computation for graphs of bounded clique-width
From MaRDI portal
Publication:1010789
Recommendations
Cited in
(18)- Computing Graph Polynomials on Graphs of Bounded Clique-Width
- Fast evaluation of interlace polynomials on graphs of bounded treewidth
- On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications
- Recurrence relations for graph polynomials on bi-iterative families of graphs
- On the Tutte and Matching Polynomials for Complete Graphs
- Exponential Time Complexity of Weighted Counting of Independent Sets
- 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
- On the interlace polynomials
- Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width
- Efficient computation of generalized Ising polynomials on graphs with fixed clique-width
- Binary nullity, Euler circuits and interlace polynomials
- Binary matroids and local complementation
- The transition matroid of a 4-regular graph: an introduction
- Evaluations of Graph Polynomials
- Subset Glauber dynamics on graphs, hypergraphs and matroids 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)