Add to ORKGThe Tutte polynomial of a graph or a matroid is a polynomial in two variables x, y, and is of central importance in the study of combinatorial counting problems.Awards: Winner of the Mollie Holman Doctoral Medal for Excellence, Faculty of Information Technology, 2010
AbstractA graph polynomial q(G;ζ) has recently been studied by Arratia et al. [The interlace polynom...
AbstractThis paper describes how I became acquainted with the Tutte polynomial, and how I was led to...
AbstractWe prove several theorems concerning Tutte polynomials T(G,x,y) for recursive families of gr...
The Tutte polynomial is an important tool in graph theory. This paper provides an introduction to th...
Matroids are combinatorial objects that capture abstractly the essence of dependence. The Tutte poly...
Matroids are combinatorial objects that capture abstractly the essence of dependence. The Tutte poly...
AbstractWe give a general convolution–multiplication identity for the multivariate and bivariate ran...
The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal p...
This chapter examines the complexity of evaluating graph polynomials, related to the Tutte polynomia...
This chapter examines the complexity of evaluating graph polynomials, related to the Tutte polynomia...
This chapter examines the complexity of evaluating graph polynomials, related to the Tutte polynomia...
The multivariate Tutte polynomial (known to physicists as the Potts-model partition function) can be...
The problem of computing the Tutte polynomial of a graph has been a hot topic in recent years, becau...
AbstractThis paper initiates a general study of the connection between graph homomorphisms and the T...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2007.Includes bibliograp...
AbstractA graph polynomial q(G;ζ) has recently been studied by Arratia et al. [The interlace polynom...
AbstractThis paper describes how I became acquainted with the Tutte polynomial, and how I was led to...
AbstractWe prove several theorems concerning Tutte polynomials T(G,x,y) for recursive families of gr...
The Tutte polynomial is an important tool in graph theory. This paper provides an introduction to th...
Matroids are combinatorial objects that capture abstractly the essence of dependence. The Tutte poly...
Matroids are combinatorial objects that capture abstractly the essence of dependence. The Tutte poly...
AbstractWe give a general convolution–multiplication identity for the multivariate and bivariate ran...
The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal p...
This chapter examines the complexity of evaluating graph polynomials, related to the Tutte polynomia...
This chapter examines the complexity of evaluating graph polynomials, related to the Tutte polynomia...
This chapter examines the complexity of evaluating graph polynomials, related to the Tutte polynomia...
The multivariate Tutte polynomial (known to physicists as the Potts-model partition function) can be...
The problem of computing the Tutte polynomial of a graph has been a hot topic in recent years, becau...
AbstractThis paper initiates a general study of the connection between graph homomorphisms and the T...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2007.Includes bibliograp...
AbstractA graph polynomial q(G;ζ) has recently been studied by Arratia et al. [The interlace polynom...
AbstractThis paper describes how I became acquainted with the Tutte polynomial, and how I was led to...
AbstractWe prove several theorems concerning Tutte polynomials T(G,x,y) for recursive families of gr...