A Contribution to the Theory of Chromatic Polynomials

  title={A Contribution to the Theory of Chromatic Polynomials},
  author={William T. Tutte},
  journal={Canadian Journal of Mathematics},
  pages={80 - 91}
  • W. T. Tutte
  • Published 1954
  • Mathematics
  • Canadian Journal of Mathematics
Summary Two polynomials θ(G, n) and ϕ(G, n) connected with the colourings of a graph G or of associated maps are discussed. A result believed to be new is proved for the lesser-known polynomial ϕ(G, n). Attention is called to some unsolved problems concerning ϕ(G, n) which are natural generalizations of the Four Colour Problem from planar graphs to general graphs. A polynomial χ(G, x, y) in two variables x and y, which can be regarded as generalizing both θ(G, n) and ϕ(G, n) is studied. For a… 
On the Cover Polynomial of a Digraph
The cover polynomial C(D; x, y) for a directed graph D is introduced and its relationships to other graph polynomials are examined.
On Tutte polynomials and cycles of plane graphs
  • F. Jaeger
  • Mathematics
    J. Comb. Theory, Ser. B
  • 1988
Let G be a connected ( p , q)-graph, that is, a graph with p points and q lines. Let T ( G ; x , y ) be the Tutte polynomial of G, and let P(G, A) be the chromatic polynomial of G. We consider a
On the edge cover polynomial of a graph
On the Tutte and matching polynomials for complete graphs
. Let T ( G ; X, Y ) be the Tutte polynomial for graphs. We study the sequence t a,b ( n ) = T ( K n ; a, b ) where a, b are integers, and show that for every µ ∈ N the sequence t a,b ( n ) is
On the Differential Polynomial of a Graph
We introduce the differential polynomial of a graph. The differential polynomial of a graph G of order n is the polynomial
Random cluster model on regular graphs
. For a graph G = ( V, E ) with v ( G ) vertices the partition function of the random cluster model is defined by where k ( A ) denotes the number of connected components of the graph ( V, A ) . In
Tutte polynomial expansions for 2-separable graphs


The Coloring of Graphs.
  • H. Whitney
  • Mathematics
    Proceedings of the National Academy of Sciences of the United States of America
  • 1931
The author has given a proof of a formula for M(λ), the number of ways of coloring a graph in λ colors, due to Birkhoff, which is here studied in detail.
The Dissection of Rectangles Into Squares
We consider the problem of dividing a rectangle into a finite number of non-overlapping squares, no two of which are equal. A dissection of a rectangle R into a finite number n of non-overlapping
On the Imbedding of Linear Graphs in Surfaces
A logical expansion in mathematics