AbstractThe V-functions of Tutte [1] are generalized to U-functions on graphs with a distinguished subset of vertices. The class of U-functions of two variables generalize dichromatic polynomials as well as the W-functions defined by Tutte [2]. The values of U-functions on a graph G are characterized in terms of spanning subgraphs of G and also in terms of collections of simple graphs constructed from G. Decompositions of dichromatic polynomials as well as dichromatic U-functions are obtained in terms of decompositions of G
We present a two-variable polynomial, which simultaneously generalizes the chromatic polynomial, th...
We present a two-variable polynomial, which simultaneously generalizes the chromatic polynomial, the...
The U-polynomial, the polychromate and the symmetric function generalization of the Tutte polynomial...
AbstractThe V-functions of Tutte [1] are generalized to U-functions on graphs with a distinguished s...
The U-polynomial, the polychromate and the symmetric function generalization of the Tutte polynomial...
The U-polynomial, the polychromate and the symmetric function generalization of the Tutte polynomial...
The Tutte polynomial is an important tool in graph theory. This paper provides an introduction to th...
AbstractA simple decomposition for graphs yields generating functions for counting graphs by edges a...
AbstractWe consider generalizations of the Tutte polynomial on multigraphs obtained by keeping the m...
This chapter covers the U-, W-, V- and strong U-polynomials, generalizations of the Tutte polynomial...
This chapter covers the U-, W-, V- and strong U-polynomials, generalizations of the Tutte polynomial...
We define a polynomial W on graphs with colours on the edges, by generalizing the spanning tree expa...
AbstractFor a finite graph G with d vertices we define a homogeneous symmetric function XG of degree...
We define a polynomial W on graphs with colours on the edges, by generalizing the spanning tree expa...
Defined by Richard Stanley in the early 1990s, the chromatic symmetric function XG of a graph G enum...
We present a two-variable polynomial, which simultaneously generalizes the chromatic polynomial, th...
We present a two-variable polynomial, which simultaneously generalizes the chromatic polynomial, the...
The U-polynomial, the polychromate and the symmetric function generalization of the Tutte polynomial...
AbstractThe V-functions of Tutte [1] are generalized to U-functions on graphs with a distinguished s...
The U-polynomial, the polychromate and the symmetric function generalization of the Tutte polynomial...
The U-polynomial, the polychromate and the symmetric function generalization of the Tutte polynomial...
The Tutte polynomial is an important tool in graph theory. This paper provides an introduction to th...
AbstractA simple decomposition for graphs yields generating functions for counting graphs by edges a...
AbstractWe consider generalizations of the Tutte polynomial on multigraphs obtained by keeping the m...
This chapter covers the U-, W-, V- and strong U-polynomials, generalizations of the Tutte polynomial...
This chapter covers the U-, W-, V- and strong U-polynomials, generalizations of the Tutte polynomial...
We define a polynomial W on graphs with colours on the edges, by generalizing the spanning tree expa...
AbstractFor a finite graph G with d vertices we define a homogeneous symmetric function XG of degree...
We define a polynomial W on graphs with colours on the edges, by generalizing the spanning tree expa...
Defined by Richard Stanley in the early 1990s, the chromatic symmetric function XG of a graph G enum...
We present a two-variable polynomial, which simultaneously generalizes the chromatic polynomial, th...
We present a two-variable polynomial, which simultaneously generalizes the chromatic polynomial, the...
The U-polynomial, the polychromate and the symmetric function generalization of the Tutte polynomial...