AbstractAn explicit formula for the chromatic polynomials of certain families of graphs, called `bracelets', is obtained. The terms correspond to irreducible representations of symmetric groups. The theory is developed using the standard bases for the Specht modules of representation theory, and leads to an effective means of calculation
AbstractThis paper is concerned with structural and algorithmic aspects of certain R-bases in polyno...
AbstractA study is made of the combinatorial properties of the dichromatic polynomials of graphs, es...
AbstractIn this paper we discuss the chromatic polynomial of a ‘bracelet’, when the base graph is a ...
AbstractAn explicit formula for the chromatic polynomials of certain families of graphs, called `bra...
An explicit formula for the chromatic polynomials of certain families of graphs, called ‘bracelets’,...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
AbstractThe chromatic polynomials considered in this paper are associated with graphs constructed in...
AbstractThe chromatic polynomials considered in this paper are associated with graphs constructed in...
The chromatic polynomials of certain families of graphs can be calculated by a transfer matrix metho...
The chromatic polynomials of ‘bracelets’ can be studied by means of a theory based on representation...
AbstractIn this paper we discuss the chromatic polynomial of a ‘bracelet’, when the base graph is a ...
International audienceThe Stanley chromatic polynomial of a graph $G$ is a symmetric function genera...
The chromatic polynomials of some families of quadrangulations of the torus can be found explicitly....
In this paper we give first a new combinatorial interpretation of the coefficients of chromatic poly...
AbstractThe chromatic polynomial (or chromial) of a graph was first defined by Birkhoff in 1912, and...
AbstractThis paper is concerned with structural and algorithmic aspects of certain R-bases in polyno...
AbstractA study is made of the combinatorial properties of the dichromatic polynomials of graphs, es...
AbstractIn this paper we discuss the chromatic polynomial of a ‘bracelet’, when the base graph is a ...
AbstractAn explicit formula for the chromatic polynomials of certain families of graphs, called `bra...
An explicit formula for the chromatic polynomials of certain families of graphs, called ‘bracelets’,...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
AbstractThe chromatic polynomials considered in this paper are associated with graphs constructed in...
AbstractThe chromatic polynomials considered in this paper are associated with graphs constructed in...
The chromatic polynomials of certain families of graphs can be calculated by a transfer matrix metho...
The chromatic polynomials of ‘bracelets’ can be studied by means of a theory based on representation...
AbstractIn this paper we discuss the chromatic polynomial of a ‘bracelet’, when the base graph is a ...
International audienceThe Stanley chromatic polynomial of a graph $G$ is a symmetric function genera...
The chromatic polynomials of some families of quadrangulations of the torus can be found explicitly....
In this paper we give first a new combinatorial interpretation of the coefficients of chromatic poly...
AbstractThe chromatic polynomial (or chromial) of a graph was first defined by Birkhoff in 1912, and...
AbstractThis paper is concerned with structural and algorithmic aspects of certain R-bases in polyno...
AbstractA study is made of the combinatorial properties of the dichromatic polynomials of graphs, es...
AbstractIn this paper we discuss the chromatic polynomial of a ‘bracelet’, when the base graph is a ...
DOI
Add to ORKG