A Family of Chromatically Unique k-Bridge Graphs

Let P (G, lambda) denotes the chromatic polynomial of a graph G. Two graphs G and H are chromatically equivalent, written G ~ H, if P (G, lambda) = P (H, lambda). A graph G is chromatically unique written chi-unique, if for any graph H, G ~ H implies that G is isomorphic with H. In this paper we prove the chromatic uniqueness of a new family of k-bridge graphs.