Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5897544
Recommendations
- Computing the Tutte Polynomial on Graphs of Bounded Clique‐Width
- An algorithm for the Tutte polynomials of graphs of bounded treewidth
- Computing Graph Polynomials on Graphs of Bounded Clique-Width
- Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
- Computing the Tutte polynomial of a graph of moderate size
Cited in
(14)- On the colored Tutte polynomial of a graph of bounded treewidth
- Computing the clique number of \(a\)-perfect graphs in polynomial time
- FAST EXPONENTIAL-TIME ALGORITHMS FOR THE FOREST COUNTING AND THE TUTTE POLYNOMIAL COMPUTATION IN GRAPH CLASSES
- An extension of the bivariate chromatic polynomial
- Efficient computation of generalized Ising polynomials on graphs with fixed clique-width
- Formulas for the computation of the Tutte polynomial of graphs with parallel classes
- Computing Graph Polynomials on Graphs of Bounded Clique-Width
- Leaves for packings with block size four
- A Most General Edge Elimination Polynomial
- Computing the Tutte Polynomial on Graphs of Bounded Clique‐Width
- Bipartite graphs as polynomials and polynomials as bipartite graphs
- An algorithm for the Tutte polynomials of graphs of bounded treewidth
- Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width
- scientific article; zbMATH DE number 6850484 (Why is no real title available?)
This page was built for publication: Graph-Theoretic Concepts in Computer Science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897544)
