Tutte Polynomials and Link Polynomials

DOI10.2307/2047194zbMath0665.57006OpenAlexW4256351554MaRDI QIDQ3816723

François Jaeger

Publication date: 1988

Full work available at URL: https://doi.org/10.2307/2047194

zbMATH Keywords

Potts modelstatistical mechanicscoloring of graphslink polynomialsConway-Jones-polynomialTutte dichromatic polynomial

Mathematics Subject Classification ID

Classical equilibrium statistical mechanics (general) (82B05) Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15) General models, approaches, and methods in mechanics of particles and systems (70G99)

Related Items

Knots and Graphs: Two Centuries of Interaction, Knot polynomials and generalized mutation, Algorithmic uses of the Feferman-Vaught theorem, Orientable arithmetic matroids, Tutte and Jones polynomials of links, polyominoes and graphical recombination patterns, Dichromatic polynomial for graph of a \((2, n)\)-torus knot, On plane graphs with link component number equal to the nullity, The Homfly polynomial of double crossover links, Expansions for the Bollobás-Riordan polynomial of separable ribbon graphs, The Homfly and dichromatic polynomials, On the location of zeros of the Homfly polynomial, Knot invariants and the Bollobás-Riordan polynomial of embedded graphs, Coloring invariants of knots and links are often intractable, Plane graphs and link invariants, On graphs determining links with maximal number of components via medial construction, Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width, The t₃, moves conjecture for oriented links with matched diagrams, A logician's view of graph polynomials, The number of circles of a maximum state of a plane graph with applications, A Dichromatic Polynomial for Weighted Graphs and Link Polynomials, A formula for the HOMFLY polynomial of rational links, The HOMFLY polynomials of odd polyhedral links, Unnamed Item, From a zoo to a zoology: Towards a general theory of graph polynomials, On the computational complexity of the Jones and Tutte polynomials, Interior polynomial for signed bipartite graphs and the HOMFLY polynomial, Semantic Equivalence of Graph Polynomials Definable in Second Order Logic, Graph polynomials and symmetries, Partial duality and Bollobás and Riordan's ribbon graph polynomial, Combinatorics and topology - François Jaeger's work in knot theory, A weighted graph polynomial from chromatic invariants of knots, The computational complexity of knot and matroid polynomials

Cites Work

• A spanning tree expansion of the Jones polynomial
• State models and the Jones polynomial
• Jones polynomials and classical conjectures in knot theory
• Every planar map is four colorable. I: Discharging
• A polynomial invariant of knots and links
• A polynomial invariant for knots via von Neumann algebras
• A new polynomial invariant of knots and links
• Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem
• A Contribution to the Theory of Chromatic Polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item