Publication date
April 2002
DOI Publisher
Elsevier Science B.V. ISSN
0012-365XAbstract
AbstractThe recently introduced chain and sheaf polynomials of a graph are shown to be essentially equivalent to a weighted version of the Tutte polynomial
AbstractThe recently introduced chain and sheaf polynomials of a graph are shown to be essentially equivalent to a weighted version of the Tutte polynomial
AbstractWe observe that a formula given by Negami [Polynomial invariants of graphs, Trans. Amer. Mat...
International audienceThe Tutte polynomial for matroids is not directly applicable to polymatroids. ...
AbstractWe introduce a 4-variable polynomial Q as a natural invariant linking a pair of matroids on ...
AbstractWe study a polynomial which contains, as special cases, the Tutte polynomials of all members...
AbstractNegami has introduced two polynomials for graphs and proved a number of properties of them. ...
AbstractThis paper describes how I became acquainted with the Tutte polynomial, and how I was led to...
The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal p...
AbstractFor any matroidMrealizable over Q, we give a combinatorial interpretation of the Tutte polyn...
Negami has introduced two polynomials for graphs and proved a number of properties of them. In this ...
AbstractThis paper initiates a general study of the connection between graph homomorphisms and the T...
In this paper, using a well-known recursion for computing the Tutte polynomial of any graph, we foun...
AbstractWe introduce the notions of arithmetic colorings and arithmetic flows over a graph with labe...
AbstractWe use weighted characteristic polynomials to compute Tutte polynomials of generalized paral...
Motivated by the work of Chmutov, Duzhin and Lando on Vassiliev invariants, we define a polynomial o...
AbstractTutte polynomials are important graph invariants with rich applications in combinatorics, to...
AbstractWe observe that a formula given by Negami [Polynomial invariants of graphs, Trans. Amer. Mat...
International audienceThe Tutte polynomial for matroids is not directly applicable to polymatroids. ...
AbstractWe introduce a 4-variable polynomial Q as a natural invariant linking a pair of matroids on ...
AbstractWe study a polynomial which contains, as special cases, the Tutte polynomials of all members...
AbstractNegami has introduced two polynomials for graphs and proved a number of properties of them. ...
AbstractThis paper describes how I became acquainted with the Tutte polynomial, and how I was led to...
The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal p...
AbstractFor any matroidMrealizable over Q, we give a combinatorial interpretation of the Tutte polyn...
Negami has introduced two polynomials for graphs and proved a number of properties of them. In this ...
AbstractThis paper initiates a general study of the connection between graph homomorphisms and the T...
In this paper, using a well-known recursion for computing the Tutte polynomial of any graph, we foun...
AbstractWe introduce the notions of arithmetic colorings and arithmetic flows over a graph with labe...
AbstractWe use weighted characteristic polynomials to compute Tutte polynomials of generalized paral...
Motivated by the work of Chmutov, Duzhin and Lando on Vassiliev invariants, we define a polynomial o...
AbstractTutte polynomials are important graph invariants with rich applications in combinatorics, to...
AbstractWe observe that a formula given by Negami [Polynomial invariants of graphs, Trans. Amer. Mat...
International audienceThe Tutte polynomial for matroids is not directly applicable to polymatroids. ...
AbstractWe introduce a 4-variable polynomial Q as a natural invariant linking a pair of matroids on ...
Add to ORKG