Add to ORKGThe chromatic polynomials of ‘bracelets’ can be studied by means of a theory based on representations of the symmetric group. This paper contains a detailed study of the theory as it relates to one type of bracelet. The underlying theory is presented rather more clearly than hitherto, and some surprising features are exhibited. The methods involve an extension of the standard theory of distance-regular graphs, and they lead to several plausible conjectures
The chromatic polynomials of some families of quadrangulations of the torus can be found explicitly....
AbstractA study is made of the combinatorial properties of the dichromatic polynomials of graphs, es...
AbstractLet P(G,q) be the chromatic polynomial for coloring the n-vertex graph G with q colors, and ...
AbstractThe chromatic polynomials considered in this paper are associated with graphs constructed in...
AbstractAn explicit formula for the chromatic polynomials of certain families of graphs, called `bra...
AbstractThe chromatic polynomials considered in this paper are associated with graphs constructed in...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
In this paper we give first a new combinatorial interpretation of the coefficients of chromatic poly...
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’,...
AbstractIn this paper, we describe some unsolved problems on chromatic polynomials along with a brie...
We propose two conjectures on the chromatic polynomial of a graph and show their validity for severa...
AbstractLet P(G, λ) denote the chromatic polynomial of a graph G. It is proved in this paper that fo...
Chromatic polynomials of graphs have been studied extensively for around one century. The concept of...
AbstractThe chromatic polynomial (or chromial) of a graph was first defined by Birkhoff in 1912, and...
The chromatic polynomials of some families of quadrangulations of the torus can be found explicitly....
AbstractA study is made of the combinatorial properties of the dichromatic polynomials of graphs, es...
AbstractLet P(G,q) be the chromatic polynomial for coloring the n-vertex graph G with q colors, and ...
AbstractThe chromatic polynomials considered in this paper are associated with graphs constructed in...
AbstractAn explicit formula for the chromatic polynomials of certain families of graphs, called `bra...
AbstractThe chromatic polynomials considered in this paper are associated with graphs constructed in...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
In this paper we give first a new combinatorial interpretation of the coefficients of chromatic poly...
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’,...
AbstractIn this paper, we describe some unsolved problems on chromatic polynomials along with a brie...
We propose two conjectures on the chromatic polynomial of a graph and show their validity for severa...
AbstractLet P(G, λ) denote the chromatic polynomial of a graph G. It is proved in this paper that fo...
Chromatic polynomials of graphs have been studied extensively for around one century. The concept of...
AbstractThe chromatic polynomial (or chromial) of a graph was first defined by Birkhoff in 1912, and...
The chromatic polynomials of some families of quadrangulations of the torus can be found explicitly....
AbstractA study is made of the combinatorial properties of the dichromatic polynomials of graphs, es...
AbstractLet P(G,q) be the chromatic polynomial for coloring the n-vertex graph G with q colors, and ...