A Tutte Polynomial for Coloured Graphs
From MaRDI portal
Publication:4243071
DOI10.1017/S0963548398003447zbMATH Open0926.05017OpenAlexW2092277386MaRDI QIDQ4243071FDOQ4243071
Authors: Béla Bollobás, Oliver Riordan 
Publication date: 11 May 1999
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548398003447
Recommendations
Cited In (58)
- Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants
- The Jones polynomial from a Goeritz matrix
- Polychromatic Acyclic Tours in Colored Multigraphs
- Parallel connections and coloured Tutte polynomials
- Complexity of the Bollobás-Riordan Polynomial
- Interlace polynomials for multimatroids and delta-matroids
- Arrow ribbon graphs
- Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions
- Generalization of the Bollobás-Riordan polynomial for tensor graphs
- Graphs determined by polynomial invariants
- Algorithmic uses of the Feferman-Vaught theorem
- On the colored Tutte polynomial of a graph of bounded treewidth
- Euler characteristics and chromatic polynomials
- Invariants of composite networks arising as a tensor product
- Multivariable, parameterized, and colored extensions of the Tutte polynomial
- Topological graph polynomials in colored group field theory
- An extension of the bivariate chromatic polynomial
- Universal Tutte characters via combinatorial coalgebras
- A Tutte polynomial for signed graphs
- Some families of links with divergent Mahler measure
- On Tutte's chromatic invariant
- A little statistical mechanics for the graph theorist
- Fourientation activities and the Tutte polynomial
- Graph colorings, flows and arithmetic Tutte polynomial
- Universal Tutte polynomial
- A Most General Edge Elimination Polynomial
- Relative Tutte Polynomials for Coloured Graphs and Virtual Knot Theory
- Complexity and approximability of the cover polynomial
- Tutte polynomial expansions for 2-separable graphs
- Relative Tutte Polynomials of Tensor Products of Coloured Graphs
- Transition polynomials
- Distinguishing graphs by their left and right homomorphism profiles
- Fast evaluation of interlace polynomials on graphs of bounded treewidth
- Tutte chromatic identities from the Temperley-Lieb algebra
- A Tutte-style proof of Brylawski's tensor product formula
- On the algebraic complexity of some families of coloured Tutte polynomials
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
- On an ordering-dependent generalization of the Tutte polynomial
- A Subset Expansion of the Coloured Tutte Polynomial
- Binary matroids and local complementation
- The transition matroid of a 4-regular graph: an introduction
- Farrell polynomials on graphs of bounded tree width
- A NOTE ON THE TUTTE POLYNOMIAL AND THE AUTOMORPHISM GROUP OF A GRAPH
- Linear Recurrence Relations for Graph Polynomials
- From a zoo to a zoology: Towards a general theory of graph polynomials
- The Homfly and dichromatic polynomials
- TUTTE POLYNOMIALS OF TENSOR PRODUCTS OF SIGNED GRAPHS AND THEIR APPLICATIONS IN KNOT THEORY
- The architecture of polyhedral links and their HOMFLY polynomials
- The replacements of signed graphs and Kauffman brackets of link families
- New graph polynomials from the Bethe approximation of the Ising partition function
- Homomorphisms and polynomial invariants of graphs
- Jones polynomial of knots formed by repeated tangle replacement operations
- ON TANGLES AND MATROIDS
- On the Potts model partition function in an external field
- Odd Khovanov homology for hyperplane arrangements
- Tutte's dichromate for signed graphs
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
- Contraction-deletion invariants for graphs
This page was built for publication: A Tutte Polynomial for Coloured Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243071)
