✦ LIBER ✦

Tutte polynomials computable in polynomial time

✍ Scribed by J.G. Oxley; D.J.A. Welsh

Book ID: 118319649
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 717 KB
Volume: 109
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90289-r

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ehrhart polynomial and arithmetic Tutte

Ehrhart polynomial and arithmetic Tutte polynomial

✍ Michele D’Adderio; Luca Moci 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 198 KB

The Tutte polynomial

✍ Henry H. Crapo 📂 Article 📅 1969 🏛 Springer 🌐 English ⚖ 61 KB

The Tutte polynomial

✍ Dominic Welsh 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB

This is a close approximation to the content of my lecture. After a brief survey of well known properties, I present some new interpretations relating to random graphs, lattice point enumeration, and chip firing games. I then examine complexity issues and concentrate in particular, on the existence

Tutte polynomials for trees

✍ Sharad Chaudhary; Gary Gordon 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 682 KB

## Abstract We define two two‐variable polynomials for rooted trees and one two‐variable polynomial for unrooted trees, all of which are based on the coranknullity formulation of the Tutte polynomial of a graph or matroid. For the rooted polynomials, we show that the polynomial completely determine

Inapproximability of the Tutte polynomia

Inapproximability of the Tutte polynomial

✍ Leslie Ann Goldberg; Mark Jerrum 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 366 KB

Tutte polynomials of q-cones

✍ Joseph E. Bonin; Hongxun Qin 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 96 KB