A Tutte Polynomial for Coloured Graphs
From MaRDI portal
Publication:4243071
DOI10.1017/S0963548398003447zbMath0926.05017OpenAlexW2092277386MaRDI QIDQ4243071
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
Related Items
Universal Tutte characters via combinatorial coalgebras, Graphs determined by polynomial invariants, The replacements of signed graphs and Kauffman brackets of link families, Jones polynomial of knots formed by repeated tangle replacement operations, Euler characteristics and chromatic polynomials, Universal Tutte polynomial, A Most General Edge Elimination Polynomial, TUTTE POLYNOMIALS OF TENSOR PRODUCTS OF SIGNED GRAPHS AND THEIR APPLICATIONS IN KNOT THEORY, Algorithmic uses of the Feferman-Vaught theorem, Fourientation activities and the Tutte polynomial, On an ordering-dependent generalization of the Tutte polynomial, Interlace polynomials for multimatroids and delta-matroids, Complexity of the Bollobás-Riordan Polynomial, Farrell polynomials on graphs of bounded tree width, The Jones polynomial from a Goeritz matrix, Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants, Topological graph polynomials in colored group field theory, On the Potts model partition function in an external field, Fast evaluation of interlace polynomials on graphs of bounded treewidth, Some families of links with divergent Mahler measure, Complexity and approximability of the cover polynomial, The architecture of polyhedral links and their HOMFLY polynomials, Distinguishing graphs by their left and right homomorphism profiles, Tutte's dichromate for signed graphs, On the algebraic complexity of some families of coloured Tutte polynomials, The Homfly and dichromatic polynomials, Binary matroids and local complementation, The transition matroid of a 4-regular graph: an introduction, Relative Tutte Polynomials of Tensor Products of Coloured Graphs, ON TANGLES AND MATROIDS, ARROW RIBBON GRAPHS, On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic, A NOTE ON THE TUTTE POLYNOMIAL AND THE AUTOMORPHISM GROUP OF A GRAPH, Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width, A little statistical mechanics for the graph theorist, On the colored Tutte polynomial of a graph of bounded treewidth, Parallel connections and coloured Tutte polynomials, A Tutte-style proof of Brylawski's tensor product formula, Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions, Relative Tutte Polynomials for Coloured Graphs and Virtual Knot Theory, Linear Recurrence Relations for Graph Polynomials, New Graph Polynomials from the Bethe Approximation of the Ising Partition Function, From a zoo to a zoology: Towards a general theory of graph polynomials, Homomorphisms and polynomial invariants of graphs, An extension of the bivariate chromatic polynomial, Invariants of composite networks arising as a tensor product, Transition polynomials, Contraction-deletion invariants for graphs, Odd Khovanov homology for hyperplane arrangements, Generalization of the Bollobás-Riordan polynomial for tensor graphs
