Chromatic Classes of Bipartite Graphs
by
Kee Teo
Institute of Fundamental Sciences (Mathematics), Massey University

Let G be a graph. Given a positive integer k, a k-colouring of G is a mapping f from the vertex set of G to the set {1,2,...,k} such that f(u) is not equal to f(v) if u and v are adjacent in G. Let P(G,k), called the chromatic polynomial of G, be the number of k-colourings of G. Two graphs G and H are chromatically equivalent if P(G,k) = P(H,k). In this talk, the chromatic equivalence classes of certain families of bipartite graphs will be presented.

Date received: June 10, 1999