57 search results - page 2 / 12 » Inapproximability of the Tutte polynomial |
EJC
2011
12 years 9 months ago
2011
We provide a new proof of Brylawski’s formula for the Tutte polynomial of the tensor product of two matroids. Our proof involves extending Tutte’s formula, expressing the Tutte...
WG
2005
Springer
13 years 11 months ago
2005
Springer
The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree-width. Th...
GC
2008
Springer
13 years 5 months ago
2008
Springer
Gioan showed that the number of cycle reversing classes of totally cyclic orientations of a given graph can be calculated as an evaluation of the corresponding Tutte polynomial. We...
DM
2002
13 years 5 months ago
2002
The recently introduced chain and sheaf polynomials of a graph are shown to be essentially equivalent to a weighted version of the Tutte polynomial. c 2002 Elsevier Science B.V. A...
MST
2008
13 years 5 months ago
2008
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...