Sciweavers

EJC
2011
13 years 2 months ago
A Tutte-style proof of Brylawski's tensor product formula
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...
Yuanan Diao, Gábor Hetyei, Kenneth Hinson
COMBINATORICS
2002
88views more  COMBINATORICS 2002»
13 years 11 months ago
MacWilliams Identities and Matroid Polynomials
We present generalisations of several MacWilliams type identities, including those by Kl
Thomas Britz
ENDM
2007
89views more  ENDM 2007»
13 years 11 months ago
Homomorphisms and Polynomial Invariants of Graphs
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial. This connection enables us to extend the study to other important polynomial i...
Delia Garijo, Jaroslav Nesetril, M. P. Revuelta
JCT
2008
59views more  JCT 2008»
13 years 11 months ago
The Jones polynomial and graphs on surfaces
The Jones polynomial of an alternating link is a certain specialization of the Tutte polynomial of the (planar) checkerboard graph associated to an alternating projection of the li...
Oliver T. Dasbach, David Futer, Efstratia Kalfagia...
DAM
2006
100views more  DAM 2006»
13 years 11 months ago
On the colored Tutte polynomial of a graph of bounded treewidth
We observe that a formula given by S. Negami [Trans. Amer. Math. Soc. 299 (1987), 601-622] for the Tutte polynomial of a k-sum of two graphs generalizes to a colored Tutte polynom...
Lorenzo Traldi
CPC
2006
72views more  CPC 2006»
13 years 11 months ago
Parametrized Tutte Polynomials of Graphs and Matroids
We generalize and unify results on parametrized and coloured Tutte polynomials of graphs and matroids due to Zaslavsky [Trans. Amer. Math. Soc. 334 (1992), 317-347] and Bollob
Joanna A. Ellis-Monaghan, Lorenzo Traldi
WG
2005
Springer
14 years 4 months ago
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width
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...
Omer Giménez, Petr Hlinený, Marc Noy
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
14 years 11 months ago
Inapproximability of the Tutte polynomial
Leslie Ann Goldberg, Mark Jerrum