The chromatic polynomials of some families of quadrangulations of the torus can be found explicitly. The method, known as ‘bracelet theory’ is based on a decomposition in terms of representations of the symmetric group. The results are particularly appropriate for studying the limit curves of the chromatic roots of these families. In this paper these techniques are applied to a family of quadrangulations with chromatic number 3, and a simple parametric equation for the limit curve is obtained. The results are in complete agreement with experimental evidence
AbstractWe consider the large size limit of the number of q-colourings for three types of planar gra...
AbstractLet P(G,q) be the chromatic polynomial for coloring the n-vertex graph G with q colors, and ...
Tutte proved that if Gpt is a planar triangulation and P (Gpt, q) is its chromatic polynomial, then ...
The chromatic polynomials of certain families of graphs can be calculated by a transfer matrix metho...
AbstractAn explicit formula for the chromatic polynomials of certain families of graphs, called `bra...
AbstractIn this paper we discuss the chromatic polynomial of a ‘bracelet’, when the base graph is a ...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
The chromatic polynomial of a graph, is a polynomial that when evaluated at a positive integer k, is...
AbstractWe consider the large size limit of the number of q-colourings for three types of planar gra...
The chromatic polynomial of a graph, is a polynomial that when evaluated at a positive integer k, is...
AbstractThe chromatic polynomials considered in this paper are associated with graphs constructed in...
AbstractLet P(G,q) be the chromatic polynomial for coloring the n-vertex graph G with q colors, and ...
A chromatic root is a zero of the chromatic polynomial of a graph. At a Newton Institute workshop on...
The chromatic polynomials of ‘bracelets’ can be studied by means of a theory based on representation...
Although these bounding conditions do not allow us to completely predict all chromatic polynomials, ...
AbstractWe consider the large size limit of the number of q-colourings for three types of planar gra...
AbstractLet P(G,q) be the chromatic polynomial for coloring the n-vertex graph G with q colors, and ...
Tutte proved that if Gpt is a planar triangulation and P (Gpt, q) is its chromatic polynomial, then ...
The chromatic polynomials of certain families of graphs can be calculated by a transfer matrix metho...
AbstractAn explicit formula for the chromatic polynomials of certain families of graphs, called `bra...
AbstractIn this paper we discuss the chromatic polynomial of a ‘bracelet’, when the base graph is a ...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
The chromatic polynomial of a graph, is a polynomial that when evaluated at a positive integer k, is...
AbstractWe consider the large size limit of the number of q-colourings for three types of planar gra...
The chromatic polynomial of a graph, is a polynomial that when evaluated at a positive integer k, is...
AbstractThe chromatic polynomials considered in this paper are associated with graphs constructed in...
AbstractLet P(G,q) be the chromatic polynomial for coloring the n-vertex graph G with q colors, and ...
A chromatic root is a zero of the chromatic polynomial of a graph. At a Newton Institute workshop on...
The chromatic polynomials of ‘bracelets’ can be studied by means of a theory based on representation...
Although these bounding conditions do not allow us to completely predict all chromatic polynomials, ...
AbstractWe consider the large size limit of the number of q-colourings for three types of planar gra...
AbstractLet P(G,q) be the chromatic polynomial for coloring the n-vertex graph G with q colors, and ...
Tutte proved that if Gpt is a planar triangulation and P (Gpt, q) is its chromatic polynomial, then ...