139 search results - page 2 / 28 » Computing the Tutte Polynomial on Graphs of Bounded Clique-W... |
EJC
2011
12 years 8 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...
TOMS
2010
13 years 3 months ago
2010
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
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...
CIE
2006
Springer
13 years 9 months ago
2006
Springer
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...