AbstractNegami has introduced two polynomials for graphs and proved a number of properties of them. In this note, it is shown that these polynomials are intimately related to the well-known Tutte polynomial. This fact is used, together with a result of Brylawski, to answer a question of Negami
AbstractThis paper initiates a general study of the connection between graph homomorphisms and the T...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial...
Abstract. We introduce a polynomial invariant of graphs on surfaces, PG, gener-alizing the classical...
Negami has introduced two polynomials for graphs and proved a number of properties of them. In this ...
AbstractNegami has introduced two polynomials for graphs and proved a number of properties of them. ...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial....
AbstractThis paper initiates a general study of the connection between graph homomorphisms and the T...
AbstractMany polynomials have been defined associated to graphs, like the characteristic, matchings,...
AbstractMany polynomials have been defined associated to graphs, like the characteristic, matchings,...
AbstractWe observe that a formula given by Negami [Polynomial invariants of graphs, Trans. Amer. Mat...
The Tutte polynomial is an important tool in graph theory. This paper provides an introduction to th...
AbstractWe reformulate a polynomial invariant of graphs defined by Negami, using the notion of state...
We follow the example of Tutte in his construction of the dichromate of a graph (i.e. the Tutte poly...
Graph polynomials are uniformly defined families of graph invariants which are polynomials in some p...
AbstractThis paper describes how I became acquainted with the Tutte polynomial, and how I was led to...
AbstractThis paper initiates a general study of the connection between graph homomorphisms and the T...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial...
Abstract. We introduce a polynomial invariant of graphs on surfaces, PG, gener-alizing the classical...
Negami has introduced two polynomials for graphs and proved a number of properties of them. In this ...
AbstractNegami has introduced two polynomials for graphs and proved a number of properties of them. ...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial....
AbstractThis paper initiates a general study of the connection between graph homomorphisms and the T...
AbstractMany polynomials have been defined associated to graphs, like the characteristic, matchings,...
AbstractMany polynomials have been defined associated to graphs, like the characteristic, matchings,...
AbstractWe observe that a formula given by Negami [Polynomial invariants of graphs, Trans. Amer. Mat...
The Tutte polynomial is an important tool in graph theory. This paper provides an introduction to th...
AbstractWe reformulate a polynomial invariant of graphs defined by Negami, using the notion of state...
We follow the example of Tutte in his construction of the dichromate of a graph (i.e. the Tutte poly...
Graph polynomials are uniformly defined families of graph invariants which are polynomials in some p...
AbstractThis paper describes how I became acquainted with the Tutte polynomial, and how I was led to...
AbstractThis paper initiates a general study of the connection between graph homomorphisms and the T...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial...
Abstract. We introduce a polynomial invariant of graphs on surfaces, PG, gener-alizing the classical...
DOI
Add to ORKG