Computing Tutte Polynomials

DOI10.1145/1824801.1824802zbMath1364.05072OpenAlexW2032055415WikidataQ60264974 ScholiaQ60264974MaRDI QIDQ2989108

Gordon F. Royle, Gary Haggard, David J. Pearce

Publication date: 19 May 2017

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1824801.1824802

zbMATH Keywords

graph theorychromatic polynomialTutte polynomialflow polynomialgraph polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Graph algorithms (graph-theoretic aspects) (05C85) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (10)

Computing the Tutte polynomial of Archimedean tilings ⋮ Parallel family trees for transfer matrices in the Potts model ⋮ On zeros of the characteristic polynomial of matroids of bounded tree-width ⋮ On maximum graphs in Tutte polynomial posets ⋮ On some Tutte polynomial sequences in the square lattice ⋮ How Many Unicycles on a Wheel? ⋮ Dichromatic polynomial for graph of a \((2, n)\)-torus knot ⋮ On the evaluation at \(( - \iota ,\iota )\) of the Tutte polynomial of a binary matroid ⋮ Is the five-flow conjecture almost false? ⋮ The three-state Potts antiferromagnet on plane quadrangulations

This page was built for publication: Computing Tutte Polynomials