Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
From MaRDI portal
Publication:1764811
DOI10.1016/j.dam.2004.01.016zbMath1084.05505OpenAlexW2087966263MaRDI QIDQ1764811
Publication date: 22 February 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2004.01.016
Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Jones polynomial of knots formed by repeated tangle replacement operations, Harary polynomials, Fixed-Parameter Tractability of Treewidth and Pathwidth, A Most General Edge Elimination Polynomial, Evaluations of Graph Polynomials, Courcelle's theorem for triangulations, The Treewidth and Pathwidth of Graph Unions, Computing a link diagram from its exterior, The enumeration of vertex induced subgraphs with respect to the number of components, Counting truth assignments of formulas of bounded tree-width or clique-width, A little statistical mechanics for the graph theorist, On the colored Tutte polynomial of a graph of bounded treewidth, A logician's view of graph polynomials, The HOMFLY-PT polynomial is fixed-parameter tractable, Connection Matrices for MSOL-Definable Structural Invariants, Recurrence relations for graph polynomials on bi-iterative families of graphs, Computing HOMFLY polynomials of 2-bridge links from 4-plat representation, From a zoo to a zoology: Towards a general theory of graph polynomials, An extension of the bivariate chromatic polynomial
Cites Work
- Algorithmic uses of the Feferman-Vaught theorem
- Tutte polynomials computable in polynomial time
- A Tutte polynomial for signed graphs
- A spanning tree expansion of the Jones polynomial
- Kauffman's polynomial and alternating links
- Decomposition of regular matroids
- The monadic second-order logic of graphs. VII: Graphs as relational structures
- Modal languages and bounded fragments of predicate logic
- Splitting formulas for Tutte polynomials
- Farrell polynomials on graphs of bounded tree width
- On the algebraic complexity of some families of coloured Tutte polynomials
- Completeness and reduction in algebraic complexity theory
- An algorithm for the Tutte polynomials of graphs of bounded treewidth
- Directed tree-width
- Reduction algorithms for graphs of small treewidth
- The parametrized complexity of knot polynomials
- Upper bounds to the clique width of graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Fusion in relational structures and the verification of monadic second-order properties
- The first order properties of products of algebraic systems
- Easy problems for tree-decomposable graphs
- Tutte Polynomials and Link Polynomials
- Polynomial Invariants of Graphs
- Algorithmic versus axiomatic definitions of matroids
- Application of model theoretic games to discrete linear orders and finite automata
- Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
- A Tutte Polynomial for Coloured Graphs
- COMPUTING THE JONES POLYNOMIAL ON BIPARTITE GRAPHS
- The fourth Skein Module and the Montesinos-Nakanishi Conjecture for 3-algebraic links
- On the computational complexity of the Jones and Tutte polynomials
- Polynomials for Links
- Monotone monadic SNP and constraint satisfaction
- A Contribution to the Theory of Chromatic Polynomials
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
